Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003044
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A003044 M0506
%S A003044 1,2,3,4,5,6,8,10,12,15,17,19,29,31,33,43,44,47,51,54,58,68,69,78,79,
%T A003044 86,95,99,110,113,117,133,134,135,145,151,156,159,173,180,
%U A003044 183,193,197,204,211,229,232,236,239,243,250,256,264,270,281,284
%N A003044 a(n) (n>4) is least integer > a(n-1) with precisely two representations 
               a(n) = a(i) + a(j), 1<=i<j<n.
%D A003044 S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 145-151.
%D A003044 R. K. Guy, Unsolved Problems in Number Theory, Section C4.
%D A003044 R. Queneau, Sur les suites s-additives, J. Combin. Theory, A12 (1972), 
               31-71.
%D A003044 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A003044 T. D. Noe, <a href="b003044.txt">Table of n, a(n) for n=1..5440</a>
%H A003044 S. R. Finch, <a href="http://algo.inria.fr/bsolve/constant/stlrsky/sadd/
               sadd.html">Ulam s-Additive Sequences</a>
%Y A003044 Sequence in context: A018350 A033058 A060470 this_sequence A018541 A018293 
               A015702
%Y A003044 Adjacent sequences: A003041 A003042 A003043 this_sequence A003045 A003046 
               A003047
%K A003044 nonn,nice
%O A003044 1,2
%A A003044 N. J. A. Sloane (njas(AT)research.att.com).
%E A003044 Queneau left out 44.

    
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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research