login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003662 a(n) is smallest number != a(j)+a(k), j<k.
(Formerly M3273)
2
1, 4, 6, 8, 11, 13, 16, 18, 23, 25, 28, 30, 35, 37, 40, 42, 47, 49, 52, 54, 59, 61, 64, 66, 71, 73, 76, 78, 83, 85, 88, 90, 95, 97, 100, 102, 107, 109, 112, 114, 119, 121, 124, 126, 131, 133, 136, 138, 143, 145, 148, 150, 155, 157, 160, 162, 167, 169, 172, 174, 179, 181, 184 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

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

FORMULA

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

MATHEMATICA

Sort[Join[{8}, Select[Range[200], MemberQ[{1, 4, 6, 11}, Mod[#, 12]]&]]] (* From Harvey P. Dale, Apr 26 2011 *)

CROSSREFS

Cf. A060469.

Cf. A003666.

Sequence in context: A189462 A047290 A086377 * A132635 A134779 A075325

Adjacent sequences:  A003659 A003660 A003661 * A003663 A003664 A003665

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.