cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 4, 14, 48, 493, 451, 118, 3908
Offset: 1

Views

Author

Enoch Haga, Mar 02 2004

Keywords

Examples

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

Links

Crossrefs

Cf. A092663, A092664.

Formula

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

Extensions

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

A092664 Number of consecutive prime runs of 10 primes congruent to 3 mod 4 below 10^n.

Original entry on oeis.org

0, 0, 0, 0, 0, 3, 23, 337, 3605, 38037, 380962, 3799462, 37594962
Offset: 1

Views

Author

Enoch Haga, Mar 02 2004

Keywords

Examples

			a(6)=3 because 3 sets of 10 primes occur below 10^6, each run interrupted by a prime congruent to 1 mod 4.

Links

Crossrefs

Cf. A092663 A092665.

Formula

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 1 mod 4

Extensions

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
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.