|
Search: id:A105528
|
|
| |
|
| 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; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Note that if n>9, a(n) is seemingly either 3 or 4. Checked up to index 200.
|
|
PROGRAM
|
(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
|
Cf. A105527, A000045, A000213, A000288, A000322, A000383.
Sequence in context: A074070 A065067 A086411 this_sequence A076225 A140887 A132423
Adjacent sequences: A105525 A105526 A105527 this_sequence A105529 A105530 A105531
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Ferenc Adorjan (fadorjan(AT)freemail.hu), Apr 11 2005
|
|
|
Search completed in 0.002 seconds
|
