Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003667
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003667 a(n) is smallest number which is uniquely of the form a(j)+a(k) with 1<=j<k<n.
(Formerly M3746)
+0
5
1, 5, 6, 7, 8, 9, 10, 12, 20, 22, 23, 24, 26, 38, 39, 40, 41, 52, 57, 69, 70, 71, 82, 87, 98, 102, 113, 119, 129, 130, 133, 144, 160, 161, 162, 163, 175, 196, 205, 208, 209, 222, 223, 224, 226, 237, 253, 254, 255, 256, 268, 269, 270, 271, 272, 284, 285, 286, 303, 318 (list; graph; listen)
OFFSET

1,2

COMMENT

An Ulam-type sequence - see A002858 for many further references, comments, etc.

REFERENCES

R. K. Guy, ``s-Additive sequences,'' preprint, 1994.

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..10000

S. R. Finch, Patterns in 1-additive sequences, Experimental Mathematics 1 (1992), 57-63.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Sequence in context: A120190 A121542 A023379 this_sequence A138469 A089362 A121537

Adjacent sequences: A003664 A003665 A003666 this_sequence A003668 A003669 A003670

KEYWORD

nonn

AUTHOR

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

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 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research