Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116402
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116402 Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 1, 5, 6, 11, 17, ... +0
2
0, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 2, 2, 0, 0, 0, 1, 3, 2, 0, 0, 0, 2, 3, 1, 0, 0, 0, 3, 3, 0, 0, 0, 2, 4, 2, 0, 0, 0, 3, 3, 0, 0, 0, 1, 4, 3, 0, 0, 0, 3, 5, 2, 0, 0, 0, 4, 4, 0, 0, 0, 2, 5, 3, 0, 0, 0, 3, 4, 1, 0, 0, 0, 4, 4, 0, 0, 0, 3, 6, 3, 0, 0, 0, 5, 5, 0, 0, 0, 2 (list; graph; listen)
OFFSET

0,7

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, Y(n) Rep Sequence no. 1; electronic music created with this sequence.

CROSSREFS

Cf. A116403, A000121.

Sequence in context: A092606 A073253 A004198 this_sequence A093323 A106278 A064287

Adjacent sequences: A116399 A116400 A116401 this_sequence A116403 A116404 A116405

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research