Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083853
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A083853
%S A083853 0,1,3,6,9,14,22,24,37,40,58,61,64,95,98,103,155,153,166,171,168,247,386,
%T A083853 257,276,273,407,404,401,417,443,438,647,441,653,650,1011,705,674,708,
               1045,
%U A083853 713,1053,1048,1085,1142,1051,1090,1140,1153,1723,1158,2661,1702,1155,
               1710
%N A083853 Smallest nonnegative integer that can be written as a sum of Fibonacci 
               numbers in n ways, counting 1 twice as Fibonacci number.
%F A083853 A000121(a(n)) = n.
%Y A083853 Least inverse of A000121. Cf. A013583.
%Y A083853 Sequence in context: A130473 A082643 A135524 this_sequence A058597 A146562 
               A133331
%Y A083853 Adjacent sequences: A083850 A083851 A083852 this_sequence A083854 A083855 
               A083856
%K A083853 nonn
%O A083853 1,3
%A A083853 R. K. Guy and David W. Wilson, Jun 19 2003

    
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