A092664 -id:A092664 - cp's OEIS frontend

A092665 Absolute value of difference between counts of uninterrupted runs of 10 primes in A092663 and A092664.

0, 0, 0, 0, 0, 2, 4, 14, 48, 493, 451, 118, 3908

Offset: 1

Enoch Haga, Mar 02 2004

			a(8)=14 because in A092663 the count is 323 and in A092664 the count is 337. 337-323=14.

Lucas A. Brown, Python program.

Cf. A092663, A092664.

a(n) = |A092663(n)-A092664(n)|.

a(9) and a(10) from Sean A. Irvine, Oct 06 2011
a(11) from Chai Wah Wu, Mar 18 2018
a(12) and a(13) from Lucas A. Brown, Oct 15 2024

A092663 Number of consecutive prime runs of 10 primes congruent to 1 mod 4 below 10^n.

Original entry on oeis.org

0, 0, 0, 0, 0, 5, 19, 323, 3653, 37544, 381413, 3799344, 37591054

Offset: 1

Enoch Haga, Mar 02 2004

			a(6)=5 because 5 sets of 10 primes occur below 10^6, each run interrupted by a prime congruent to 3 mod 4. These runs start at prime(31798)=373649, prime(41181)=495377, at prime(42241)=509389, at prime(50017)=612109, *not* at prime(61457) which has a larger run length, and at prime(63146)=789097.

Lucas A. Brown, Python program.

Cf. A092664, A092665, A039702, A100672, A145990.

Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 10 primes occur before interruption by a prime congruent to 3 mod 4

a(9) and a(10) from Sean A. Irvine, Oct 06 2011
a(11) from Chai Wah Wu, Mar 18 2018
a(12) and a(13) from Lucas A. Brown, Oct 15 2024

cp's OEIS Frontend

A092665 Absolute value of difference between counts of uninterrupted runs of 10 primes in A092663 and A092664.

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

Extensions