Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003663
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003663 a(n) is smallest number != a(j)+a(k), j<k.
(Formerly M4066)
+0
2
1, 6, 8, 10, 12, 15, 17, 19, 24, 26, 28, 33, 35, 37, 42, 44, 46, 51, 53, 55, 60, 62, 64, 69, 71, 73, 78, 80, 82, 87, 89, 91, 96, 98, 100, 105, 107, 109, 114, 116, 118, 123, 125, 127, 132, 134, 136, 141, 143, 145, 150, 152, 154, 159, 161 (list; graph; listen)
OFFSET

1,2

REFERENCES

S. R. Finch, Are 0-additive sequences always regular?, Amer. Math. Monthly, 99 (1992), 671-673.

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

FORMULA

Numbers congruent to {1, 6, 8} mod 9 plus the number 12.

CROSSREFS

Cf. A060470.

Sequence in context: A064466 A026286 A048751 this_sequence A075396 A092121 A005525

Adjacent sequences: A003660 A003661 A003662 this_sequence A003664 A003665 A003666

KEYWORD

nonn

AUTHOR

njas, 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research