Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Jan 27 2025 07:52:34
%S 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,
%T 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,
%U 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
%N Number of primes == 1 mod 8 <= n.
%o (PARI) for(n=1,200,print1(sum(i=1,n,if((i*isprime(i)-1)%8,0,1)),","))
%Y Cf. A071840 (==3 mod 8), A071841 (==5 mod 8), A071842 (==7 mod 8).
%K easy,nonn,changed
%O 1,41
%A _Benoit Cloitre_, Jun 08 2002