login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093186 Number of consecutive runs of 2 odd nonprimes congruent to 3 mod 4 below 10^n. 5

%I #14 May 31 2019 03:13:37

%S 0,4,36,307,2848,25651,231031,2106565,19307362,177948719,1649246163,

%T 15360077721,143683073300

%N Number of consecutive runs of 2 odd nonprimes congruent to 3 mod 4 below 10^n.

%F Generate the odd nonprime sequence with nonprimes labeled 1 mod 4 or 3 mod 4. Add count of nonprimes to sequence if 2 nonprimes congruent to 3 mod 4 occur before interruption of a nonprime congruent to 1 mod 4

%e a(3)=36 because 36 nonprime runs of 2 occur below 10^3, each run interrupted by a nonprime congruent to 1 mod 4.

%t A091113 = Select[4 Range[0, 10^4] + 1, ! PrimeQ[#] &];

%t A091236 = Select[4 Range[0, 10^4] + 3, ! PrimeQ[#] &];

%t lst = {}; Do[If[Length[s = Select[A091236, Between[{A091113[[i]], A091113[[i + 1]]}]]] == 2, AppendTo[lst, Last[s]]], {i, Length[A091113] - 1}]; Table[Count[lst, x_ /; x < 10^n], {n, 4}] (* _Robert Price_, May 30 2019 *)

%Y Cf. A093183 A093184 A093185 A093187 A093188 A093397 A093398 A093399 A092640.

%K nonn,more

%O 1,2

%A _Enoch Haga_, Mar 30 2004

%E a(9)-a(13) from _Bert Dobbelaere_, Dec 19 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 17:24 EDT 2024. Contains 374027 sequences. (Running on oeis4.)