|
Search: id:A104451
|
|
|
| A104451 |
|
Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 2, 5, 7, 12, 19, 31, 50, 81, .... |
|
+0
1
|
|
| 0, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 2, 0, 2, 0, 0, 1, 0, 3, 0, 2, 0, 0, 2, 0, 3, 0, 1, 0, 0, 3, 0, 3, 0, 0, 2, 0, 4, 0, 2, 0, 0, 3, 0, 3, 0, 0, 1, 0, 4, 0, 3, 0, 0, 3, 0, 5, 0, 2, 0, 0, 4, 0, 4, 0, 0, 2, 0, 5, 0, 3, 0, 0, 3, 0, 4, 0, 1, 0, 0, 4, 0, 4, 0, 0, 3, 0, 6, 0, 3, 0, 0, 5, 0, 5, 0, 0, 2, 0, 6, 0, 4, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
REFERENCES
|
J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498.
D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, Fib. Quart., 4 (1966), 289-306 and 322.
|
|
LINKS
|
Ron Knott, Ron Knott's Sequence Visualiser.
|
|
CROSSREFS
|
Cf. A001060.
Sequence in context: A144628 A080101 A025895 this_sequence A106602 A106594 A143251
Adjacent sequences: A104448 A104449 A104450 this_sequence A104452 A104453 A104454
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Casey Mongoven (cm(AT)caseymongoven.com), Mar 08 2005
|
|
|
Search completed in 0.002 seconds
|
