|
|
A003310
|
|
Generated by a sieve.
(Formerly M2305)
|
|
8
|
|
|
3, 4, 5, 7, 8, 11, 13, 17, 19, 20, 26, 29, 32, 37, 38, 43, 49, 50, 56, 62, 67, 68, 71, 73, 86, 89, 91, 98, 103, 113, 116, 121, 127, 131, 133, 137, 140, 151, 158, 161, 169, 173, 179, 182, 188, 200, 206, 209, 211, 221, 227, 230, 239, 242, 247, 253, 259, 271, 277, 278
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Apply the sieve of A003309, but begin with 3 rather than 2.
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Popular Computing (Calabasas, CA), Sieves: Problem 43, Vol. 2 (No. 13, Apr 1974), pp. 6-7. This is Sieve #2. [Annotated and scanned copy]
|
|
MATHEMATICA
|
t = Range[3, 330]; r = {}; While[Length[t] >0, k = First[t]; AppendTo[r, k]; t = Drop[t, {1, -1, k}]; ]r (* Ray Chandler, Dec 02 2004 *)
|
|
PROG
|
(Haskell)
a003310 n = a003310_list !! (n-1)
a003310_list = f [3..] where
f (x:xs) = x : f (g xs) where
g zs = us ++ g vs where (us, _:vs) = splitAt (x - 1) zs
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|