Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111458
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111458 Numbers n that cannot be represented as the sum of at most three Fibonacci numbers (with repetitions allowed). +0
2
33, 46, 51, 53, 54, 67, 72, 74, 75, 80, 82, 83, 85, 86, 87, 88, 101, 106, 108, 109, 114, 116, 117, 119, 120, 121, 122, 127, 129, 130, 132, 133, 134, 135, 137, 138, 139, 140, 141, 142, 143, 156, 161, 163, 164, 169, 171, 172 (list; graph; listen)
OFFSET

1,1

EXAMPLE

33 is neither a Fibonacci number nor can be written as the sum of two or three Fibonacci numbers.

CROSSREFS

Cf. A000045, A000119.

Sequence in context: A060876 A070121 A070122 this_sequence A111502 A080933 A020293

Adjacent sequences: A111455 A111456 A111457 this_sequence A111459 A111460 A111461

KEYWORD

nonn

AUTHOR

Stefan Steinerberger (hansibal(AT)hotmail.com), Nov 15 2005

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research