2000 character limit reached
Log-concavity of the Fennessey-Larcombe-French Sequence
Published 7 Mar 2015 in math.CO | (1503.02151v1)
Abstract: We prove the log-concavity of the Fennessey-Larcombe-French sequence based on its three-term recurrence relation, which was recently conjectured by Zhao. The key ingredient of our approach is a sufficient condition for log-concavity of a sequence subject to certain three-term recurrence.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.