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
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
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
-- Reinhard Zumkeller, Nov 12 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Ray Chandler, Dec 02 2004
STATUS
approved