|
Search: id:A067593
|
|
| |
|
| 1, 1, 2, 3, 5, 6, 9, 12, 16, 20, 26, 33, 41, 50, 62, 75, 90, 107, 129, 151, 178, 208, 244, 281, 326, 375, 431, 491, 561, 638, 723, 816, 922, 1037, 1163, 1302, 1458, 1624, 1808, 2009, 2231, 2467, 2729, 3012, 3321, 3651, 4014, 4406
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
G.f.=1/[(1-x^2)*product(1-x^(fibonacci(i-1)+fibonacci(i+1)), i=1..infinity)]. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 23 2005
|
|
EXAMPLE
|
a(5)=6 because we have 4+1, 3+2, 3+1+1, 2+2+1, 2+1+1+1 and 1+1+1+1+1.
|
|
CROSSREFS
|
Sequence in context: A126785 A026317 A008768 this_sequence A084993 A046966 A035948
Adjacent sequences: A067590 A067591 A067592 this_sequence A067594 A067595 A067596
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Naohiro Nomoto (n_nomoto(AT)yabumi.com), Jan 31 2002
|
|
|
Search completed in 0.002 seconds
|
