%I M2305
%S 3,4,5,7,8,11,13,17,19,20,26,29,32,37,38,43,49,50,56,62,67,68,71,73,
%T 86,89,91,98,103,113,116,121,127,131,133,137,140,151,158,161,169,173,
%U 179,182,188,200,206,209,211,221,227,230,239,242,247,253,259,271,277,278
%N Generated by a sieve.
%C Apply the sieve of A003309, but begin with 3 rather than 2.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Reinhard Zumkeller, <a href="/A003310/b003310.txt">Table of n, a(n) for n = 1..1000</a>
%H Popular Computing (Calabasas, CA), <a href="/A003309/a003309.pdf">Sieves: Problem 43</a>, Vol. 2 (No. 13, Apr 1974), pp. 67. This is Sieve #2. [Annotated and scanned copy]
%H <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%t 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 *)
%o (Haskell)
%o a003310 n = a003310_list !! (n1)
%o a003310_list = f [3..] where
%o f (x:xs) = x : f (g xs) where
%o g zs = us ++ g vs where (us, _:vs) = splitAt (x  1) zs
%o  _Reinhard Zumkeller_, Nov 12 2014
%Y Cf. A003309, A100464.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_.
%E More terms from _Ray Chandler_, Dec 02 2004
