The Catalan–Larcombe–French sequence is infinitely log-convex

At least 9 years old · documented by

Let {Pn}n≥0\{P_n\}_{n\geq 0} be the Catalan–Larcombe–French sequence. A sequence is infinitely log-convex if every sequence obtained by repeatedly applying the operator L(a)n=an2−an−1an+1\mathcal{L}(a)_n=a_n^2-a_{n-1}a_{n+1} is log-convex wherever defined. Infinite log-convexity conjecture. The Catalan–Larcombe–French sequence is ∞\infty-log-convex. The paper has established strict 2-log-convexity, and the conjecture proposes that this property continues under arbitrarily many iterations.

References

Primary source

Brian Yi Sun and Baoyindureng Wu, “Two-log-convexity of the Catalan-Larcombe-French sequence”, arXiv:1602.04909 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.