PROG
....for i in xrangerange(3, int(n**0.5)+1, 2):
....return [2] + [i for i in xrangerange(3, n, 2) if sieve[i]]
The OEIS is supported by the many generous donors to the OEIS Foundation.
....for i in xrangerange(3, int(n**0.5)+1, 2):
....return [2] + [i for i in xrangerange(3, n, 2) if sieve[i]]
editing
approved
Manfred Scheucher and Robert G. Wilson v, <a href="/A245770/b245770.txt">Table of n, a(n) for n = 1..1029</a> The (first 422 terms from Manfred Scheucher.)
141 9 653589 93238462643... Then 11, 13, 17, etc., until the first occurrence of every prime is eliminated from the digits of piPi.
approved
editing
Manfred Scheucher and Robert G. Wilson v, <a href="/A245770/b245770_2.txt">Table of n, a(n) for n = 1..1029</a> The first 422 from Manfred Scheucher.
proposed
approved
editing
proposed
a(14) corrected by Manfred Scheucher, May 25 2015.
proposed
editing
editing
proposed
Manfred Scheucher, and Robert G. Wilson v, <a href="/A245770/b245770_2.txt">Table of n, a(n) for n = 1..1029</a> The first 422</a> from Manfred Scheucher.
approved
editing
Manfred Scheucher, <a href="/A245770/b245770_1.txt">Table of n, a(n) for n = 1..422</a>