|
%I #11 Aug 29 2018 06:32:41
%S 7,19,43,67,79,103,127,163,199,307,359,379,439,463,619,643,683,719,
%T 739,823,859,883,967,983,1087,1163,1279,1303,1423,1439,1459,1483,1499,
%U 1559,1663,1783,1811,1867,1979,1999,2083,2099,2179,2239,2347,2399,2447,2531,2579,2659,2683,2699,2803,2843,2879
%N Primes that start a run of at least 2 consecutive primes of the form 4k+3.
%D Enoch Haga, Exploring Primes on Your PC and the Internet, 1994-2007. Pp. 30-31. ISBN 978-1-885794-24-6
%e a(1)=7 because this sequence includes consecutive runs of any length and this first term >1 in a run of 2 is 7.
%p A145993 := proc()
%p local m,p,r,i,sp ;
%p m := 3 ;
%p p := 2 ;
%p r := 0 ;
%p sp := -1 ;
%p for i from 2 to 1000 do
%p if modp(p,4) = m then
%p r := r+1 ;
%p if r = 1 then
%p sp := p ;
%p end if;
%p else
%p if r > 1 then
%p printf("%d,",sp) ;
%p end if;
%p r := 0;
%p sp := -1 ;
%p end if;
%p p := nextprime(p) ;
%p end do:
%p end proc:
%p A145993() ; # _R. J. Mathar_, Aug 29 2018
%t Most[First /@ Select[ SplitBy[ Prime@ Range@ 425, Mod[#, 4] &], Mod[#[[1]], 4] == 3 && Length[#] > 1 &]] (* _Giovanni Resta_, Aug 29 2018 *)
%Y Cf. A039702, A055623, A145986, A145988, A145989, A145990, A145991, A145992 (run lengths) A145994.
%K easy,nonn
%O 1,1
%A _Enoch Haga_, Oct 26 2008
%E 619 inserted by _R. J. Mathar_, Aug 29 2018
|
