OFFSET
1,1
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Popular Computing (Calabasas, CA), Sieves: Problem 43, Vol. 2 (No. 13, Apr 1974), pp. 6-7. Based on a misreading of Sieve #3. A100464 is the correct version. [Annotated and scanned copy]
EXAMPLE
The first few sieving stages are as follows:
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 ...
3 X 5 6 X 8 9 XX 11 12 XX 14 15 XX 17 18 XX 20 ...
3 X 5 X X 8 9 XX 11 12 XX XX 15 XX 17 18 XX 20 ...
3 X 5 X X 8 X XX 11 12 XX XX 15 XX 17 18 XX 20 ...
3 X 5 X X 8 X XX 11 XX XX XX 15 XX 17 18 XX 20 ...
3 X 5 X X 8 X XX 11 XX XX XX 15 XX XX 18 XX 20 ...
PROG
(Haskell)
a003311 n = a003311_list !! (n-1)
a003311_list = f [3..] where
f (x:xs) = x : f (g xs) where
g zs = us ++ g vs where (_:us, vs) = splitAt x zs
-- Reinhard Zumkeller, Nov 12 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Entry revised Nov 29 2004
STATUS
approved