A054437 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..100.

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

Adjacent sequences: A054434 A054435 A054436 * A054438 A054439 A054440

KEYWORD

nonn

AUTHOR

Jeff Burch, May 10 2000

STATUS

approved