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.

User: David Mellinger

David Mellinger's wiki page.

David Mellinger has authored 1 sequences.

A382970 Numbers k such that {k, k+2, k+6, k+8, k+90, k+92, k+96, k+98} are all prime.

Original entry on oeis.org

11, 101, 15641, 3512981, 6655541, 20769311, 26919791, 41487071, 71541641, 160471601, 189425981, 236531921, 338030591, 409952351, 423685721, 431343461, 518137091, 543062621, 588273221, 637272191, 639387311, 647851571, 705497951, 726391571, 843404201, 895161341, 958438751, 960813851, 964812461, 985123961
Offset: 1

Views

Author

David Mellinger, Apr 10 2025

Keywords

Comments

Each term is the initial member of two prime quadruples (A007530) with a difference of 90, the second-smallest possible distance between prime quadruples (A059925 has the smallest).

Examples

			a(1) corresponds to the set of primes {11,13,17,19,101,103,107,109} and a(2) corresponds to {101,103,107,109,191,193,197,199}.

Crossrefs

Subsequence of A128467.
Cf. A007530, A059925.

Programs

  • MATLAB
    find(corr([1 1 0 1 1 zeros(1,40) 1 1 0 1 1],isprime(3:2:1e8))>7.5)*2-97

Formula

a(n) == 11 (mod 30).

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

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