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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054437 Maximal subscripts within generalized Fibonacci sequence containing n. 1

%I #12 Feb 02 2022 23:46:37

%S 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,

%T 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,

%U 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

%N Maximal subscripts within generalized Fibonacci sequence containing n.

%H David A. Englund and Marjorie Bicknell-Johnson, <a href="https://www.fq.math.ca/Scanned/38-2/englund.pdf">Maximal subscripts within generalized Fibonacci sequences</a>, Fibonacci Quarterly (2000) Vol. 38, No. 2, see p. 106.

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a054/A054437.java">Java program</a> (github)

%K nonn

%O 1,1

%A _Jeff Burch_, May 10 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:14 EDT 2024. Contains 371906 sequences. (Running on oeis4.)