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
%I A111458
%S A111458 33,46,51,53,54,67,72,74,75,80,82,83,85,86,87,88,101,106,108,109,114,
%T A111458 116,117,119,120,121,122,127,129,130,132,133,134,135,137,138,139,140,
%U A111458 141,142,143,156,161,163,164,169,171,172
%N A111458 Numbers n that cannot be represented as the sum of at most three Fibonacci 
               numbers (with repetitions allowed).
%e A111458 33 is neither a Fibonacci number nor can be written as the sum of two 
               or three Fibonacci numbers.
%Y A111458 Cf. A000045, A000119.
%Y A111458 Sequence in context: A060876 A070121 A070122 this_sequence A111502 A080933 
               A020293
%Y A111458 Adjacent sequences: A111455 A111456 A111457 this_sequence A111459 A111460 
               A111461
%K A111458 nonn
%O A111458 1,1
%A A111458 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research