Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003664
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003664 a(n) is smallest number not = a(j)+a(k), j<k.
(Formerly M1320)
+0
1
2, 5, 6, 9, 10, 13, 17, 20, 21, 24, 28, 32, 35, 36, 39, 43, 47, 50, 51, 54, 58, 62, 65, 66, 69, 73, 77, 80, 81, 84, 88, 92, 95, 96, 99, 103, 107, 110, 111, 114, 118, 122, 125, 126, 129, 133, 137, 140, 141, 144, 148, 152, 155, 156, 159, 163, 167, 170, 171, 174, 178, 182 (list; graph; listen)
OFFSET

1,1

REFERENCES

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

FORMULA

The numbers 2, 5, 6, 9, 13 mod 15, plus the number 10. - R. Stephan, Mar 28 2004

CROSSREFS

Sequence in context: A133759 A042963 A000277 this_sequence A065890 A078632 A122701

Adjacent sequences: A003661 A003662 A003663 this_sequence A003665 A003666 A003667

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 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research