The Catalan–Larcombe–French sequence is infinitely log-convex
The Catalan–Larcombe–French sequence is infinitely log-convex
Let be the Catalan–Larcombe–French sequence. A sequence is infinitely log-convex if every sequence obtained by repeatedly applying the operator is log-convex wherever defined. Infinite log-convexity conjecture. The Catalan–Larcombe–French sequence is -log-convex. The paper has established strict 2-log-convexity, and the conjecture proposes that this property continues under arbitrarily many iterations.
Sources & referencesView supporting material
Primary source
Brian Yi Sun and Baoyindureng Wu, “Two-log-convexity of the Catalan-Larcombe-French sequence”, arXiv:1602.04909 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.