Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046815
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046815 Smallest number which can be written as the sum of distinct Fibonacci numbers in n ways and such that the Zeckendorf representation of the number uses only even-subscripted Fibonacci numbers. +0
4
1, 3, 8, 21, 24, 144, 58, 63, 147, 155, 152, 173, 168, 385, 398, 461, 406, 401, 435, 1215, 440, 1016, 1011, 1063, 1053, 1045, 1066, 2608, 1050, 1139, 1160, 2650, 2642, 1155, 2663, 2807, 2647, 6841, 2969, 2749, 2736, 7145, 2757, 2791 (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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research