login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A054437
Maximal subscripts within generalized Fibonacci sequence containing n.
1
2, 3, 4, 3, 5, 4, 4, 6, 4, 5, 5, 4, 7, 5, 5, 6, 5, 6, 5, 5, 8, 5, 6, 6, 5, 7, 5, 6, 7, 5, 6, 6, 6, 9, 5, 6, 7, 6, 7, 6, 6, 8, 6, 6, 7, 6, 8, 6, 6, 7, 6, 7, 7, 6, 10, 6, 6, 7, 6, 8, 7, 6, 8, 6, 7, 7, 6, 9, 7, 6, 7, 6, 8, 7, 6, 9, 7, 7, 7, 6, 8, 7, 6, 8, 7, 8, 7, 6, 11, 7, 7, 7, 7, 8, 7, 6, 9, 7, 8, 7
OFFSET
1,1
LINKS
David A. Englund and Marjorie Bicknell-Johnson, Maximal subscripts within generalized Fibonacci sequences, Fibonacci Quarterly (2000) Vol. 38, No. 2, see p. 106.
Sean A. Irvine, Java program (github)
CROSSREFS
Sequence in context: A305801 A075850 A327565 * A335943 A287821 A341830
KEYWORD
nonn
AUTHOR
Jeff Burch, May 10 2000
STATUS
approved