login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116403 Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 4, 1, 5, 6, 11, ... 2
0, 1, 0, 0, 1, 2, 2, 1, 0, 1, 2, 3, 2, 0, 0, 2, 3, 3, 2, 0, 1, 3, 4, 3, 1, 0, 2, 3, 4, 3, 0, 0, 3, 5, 4, 2, 0, 2, 4, 5, 3, 0, 0, 3, 4, 4, 3, 0, 1, 4, 6, 5, 2, 0, 3, 5, 6, 4, 0, 0, 4, 6, 5, 3, 0, 2, 5, 6, 4, 1, 0, 3, 4, 5, 4, 0, 0, 4, 7, 6, 3, 0, 3, 6, 8, 5, 0, 0, 5, 7 (list; graph; refs; listen; history; internal format)
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

Casey Mongoven, Z(n) Rep Sequence no. 1; electronic music created with this sequence.

CROSSREFS

Cf. A116402, A000121.

Sequence in context: A055892 A194527 A104244 * A123149 A185158 A185700

Adjacent sequences:  A116400 A116401 A116402 * A116404 A116405 A116406

KEYWORD

nonn

AUTHOR

Casey Mongoven (cm(AT)caseymongoven.com), Feb 13 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:14 EST 2012. Contains 205792 sequences.