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
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.
(Formerly M0506)
+0
3
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, 86, 95, 99, 110, 113, 117, 133, 134, 135, 145, 151, 156, 159, 173, 180, 183, 193, 197, 204, 211, 229, 232, 236, 239, 243, 250, 256, 264, 270, 281, 284 (list; graph; listen)
OFFSET

1,2

REFERENCES

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 145-151.

R. K. Guy, Unsolved Problems in Number Theory, Section C4.

R. Queneau, Sur les suites s-additives, J. Combin. Theory, A12 (1972), 31-71.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=1..5440

S. R. Finch, Ulam s-Additive Sequences

CROSSREFS

Sequence in context: A018350 A033058 A060470 this_sequence A018541 A018293 A015702

Adjacent sequences: A003041 A003042 A003043 this_sequence A003045 A003046 A003047

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research