|
Search: id:A104450
|
|
|
| A104450 |
|
Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 3, 2, 5, 7, 12, 19, 31, 50, .... |
|
+0
1
|
|
| 0, 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 0, 3, 0, 2, 2, 0, 3, 0, 3, 1, 2, 3, 0, 4, 0, 3, 2, 1, 3, 0, 4, 0, 3, 3, 0, 5, 0, 4, 2, 2, 4, 0, 5, 0, 3, 3, 0, 4, 0, 4, 1, 3, 4, 0, 6, 0, 5, 3, 2, 5, 0, 6, 0, 4, 4, 0, 6, 0, 5, 2, 3, 5, 0, 6, 0, 4, 3, 1, 4, 0, 5, 0, 4, 4, 0, 7, 0, 6, 3, 3, 6, 0, 8, 0, 5, 5, 0, 7, 0, 6, 2, 4, 6, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
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. A013655.
Sequence in context: A035156 A063883 A079691 this_sequence A035226 A126043 A112022
Adjacent sequences: A104447 A104448 A104449 this_sequence A104451 A104452 A104453
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Casey Mongoven (cm(AT)caseymongoven.com), Mar 08 2005
|
|
|
Search completed in 0.002 seconds
|
