Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099798
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099798 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is not composite". +0
2
1, 2, 3, 6, 8, 11, 12, 13, 14, 15, 17, 19, 23, 29, 31, 32, 37, 38, 41, 42, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 59, 61, 62, 63, 64, 65, 67, 71, 72, 74, 79, 83, 84, 89, 97, 98, 101, 103, 107, 109, 113, 127, 131, 137, 138, 140, 141, 142, 149, 150, 151, 157, 163, 167 (list; graph; listen)
OFFSET

1,2

LINKS

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)

EXAMPLE

a(4) cannot be 4 because 4 is composite; it cannot be 5, for then 4 is not in the sequence while a(4) is not composite; but 6 is possible.

CROSSREFS

Cf. A079000, A079254, A085925, A099797.

Sequence in context: A076627 A020489 A002240 this_sequence A097383 A072893 A127758

Adjacent sequences: A099795 A099796 A099797 this_sequence A099799 A099800 A099801

KEYWORD

nonn

AUTHOR

Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 02 2004

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research