Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124168
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124168 Union of all n-Fibonacci sequences, that is, all sequences s(0) = s(1) = ... = s(n-2) = 0, s(n-1) = 1 and for k >= n, s(k) = s(k-1) + ... + s(k-n). +0
4
1, 2, 3, 4, 5, 7, 8, 13, 15, 16, 21, 24, 29, 31, 32, 34, 44, 55, 56, 61, 63, 64, 81, 89, 108, 120, 125, 127, 128, 144, 149, 208, 233, 236, 248, 253, 255, 256, 274, 377, 401, 464, 492, 504, 509, 511, 512, 610, 773, 912, 927, 976, 987, 1004, 1016, 1021, 1023, 1024 (list; graph; listen)
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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research