login
A071839
Number of primes == 1 mod 8 <= n.
0
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5
OFFSET
1,41
PROG
(PARI) for(n=1, 200, print1(sum(i=1, n, if((i*isprime(i)-1)%8, 0, 1)), ", "))
CROSSREFS
Sequence in context: A339276 A343356 A242253 * A235044 A163857 A185715
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 08 2002
STATUS
approved