The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A105528 First differences of A105527. 1
1, 2, 3, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Note that if n>9, a(n) is seemingly either 3 or 4. Checked up to index 200.
LINKS
PROG
(PARI) {n_bonacci(n, v)= local(x, l); l=matsize(v)[2]; x=0; for(i=l-n+1, l, x+=v[i]); return(x)} {nbg(k)= local(q=[], l, v, m); for(n=3, k, v=[]; for(i=1, n, v=concat(v, 1)); m=n; while((x=n_bonacci(n, v))<=fibonacci(m), v=concat(v, x); m+=1); q=concat(q, m)); return(q) } z=nbg(100); d=[]; for(i=2, 98, d=concat(d, z[i]-z[i-1]))
CROSSREFS
Sequence in context: A251101 A065067 A086411 * A076225 A215776 A339085
KEYWORD
easy,nonn
AUTHOR
Ferenc Adorjan (fadorjan(AT)freemail.hu), Apr 11 2005
STATUS
approved

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 May 19 20:59 EDT 2024. Contains 372703 sequences. (Running on oeis4.)