|
Search: id:A133392
|
|
|
| A133392 |
|
Start with a(1)=1; for n >= 1, a(n+1)=a(n)+a(k) with k=[n-nth digit of "e"]. If k<0 or k=0, then a(k)=0. |
|
+0
1
|
|
| 1, 1, 1, 2, 2, 3, 3, 6, 6, 9, 10, 13, 16, 18, 36, 46, 56, 92, 128, 146, 202, 238, 476, 678, 724, 816, 1054, 1200, 2254, 3070, 3794, 6048, 6864, 7918, 13966, 17760, 18814, 21884, 25678, 33596, 40460, 66138, 88022, 105782, 211564, 229324, 317346, 357806
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Terms of this "eBonacci sequence" computed by Gilles Sadowski.
|
|
LINKS
|
Gilles Sadowski, Table of n, a(n) for n = 1..101
|
|
EXAMPLE
|
For n=7 we have a(8)=a(7)+a(k) with k=(7-1) [because "1" is the 7th digit of "e": 2,7,1,8,2,8,(1),8,2,...] So a(8)=a(7)+a(6)=3+3=6
|
|
CROSSREFS
|
Sequence in context: A147795 A038716 A035642 this_sequence A101199 A032155 A116932
Adjacent sequences: A133389 A133390 A133391 this_sequence A133393 A133394 A133395
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Nov 23 2007
|
|
|
Search completed in 0.002 seconds
|
