OFFSET
1,1
REFERENCES
Enoch Haga, Exploring Primes on Your PC and the Internet, 1994-2007. Pp. 30-31. ISBN 978-1-885794-24-6
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
EXAMPLE
MAPLE
A145992 := proc()
local m, p, r, i ;
m := 3 ;
p := 2 ;
r := 0 ;
for i from 2 to 1000 do
if modp(p, 4) = m then
r := r+1 ;
else
if r > 1 then
printf("%d, ", r) ;
end if;
r := 0;
end if;
p := nextprime(p) ;
end do:
end proc:
A145992() ; # R. J. Mathar, Aug 29 2018
MATHEMATICA
Most[Length /@ Select[ SplitBy[ Prime@ Range@ 780, Mod[#, 4] &], Mod[#[[1]], 4] == 3 && Length[#] > 1 &]] (* Giovanni Resta, Aug 29 2018 *)
Length/@Select[Split[Table[If[Mod[n, 4]==3, 1, 0], {n, Prime[Range[ 1000]]}]], FreeQ[ #, 0]&]/.(1->Nothing) (* Harvey P. Dale, Jul 27 2020 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Enoch Haga, Oct 26 2008
EXTENSIONS
Corrected by R. J. Mathar, Aug 29 2018
STATUS
approved