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
EXAMPLE
a(1)=7 because this sequence includes consecutive runs of any length and this first term >1 in a run of 2 is 7.
MAPLE
A145993 := proc()
local m, p, r, i, sp ;
m := 3 ;
p := 2 ;
r := 0 ;
sp := -1 ;
for i from 2 to 1000 do
if modp(p, 4) = m then
r := r+1 ;
if r = 1 then
sp := p ;
end if;
else
if r > 1 then
printf("%d, ", sp) ;
end if;
r := 0;
sp := -1 ;
end if;
p := nextprime(p) ;
end do:
end proc:
A145993() ; # R. J. Mathar, Aug 29 2018
MATHEMATICA
Most[First /@ Select[ SplitBy[ Prime@ Range@ 425, Mod[#, 4] &], Mod[#[[1]], 4] == 3 && Length[#] > 1 &]] (* Giovanni Resta, Aug 29 2018 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Enoch Haga, Oct 26 2008
EXTENSIONS
619 inserted by R. J. Mathar, Aug 29 2018
STATUS
approved