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.

A055625 First prime starting a chain of exactly n consecutive primes congruent to 1 modulo 6.

Original entry on oeis.org

7, 31, 151, 3049, 7351, 1741, 19471, 118801, 498259, 148531, 406951, 2513803, 2339041, 89089369, 51662593, 73451737, 232301497, 450988159, 1558562197, 2506152301, 1444257673, 28265029657, 24061965043, 87996684091, 43553959717
Offset: 1

Views

Author

Labos Elemer, Jun 05 2000

Keywords

Comments

The term "exactly" means that before the first and after the last primes of chain, the immediate primes are not congruent to 1 modulo 6.
See A057620 for the variant where "exactly" is replaced by "at least". - M. F. Hasler, Sep 03 2016

Crossrefs

Programs

  • Fortran
    c See link in A085515.
  • Mathematica
    pp = Table[{p = Prime[n], Mod[p, 6]}, {n, 10^6}];
    sp = Split[pp, Mod[#1[[2]], 6] == Mod[#2[[2]], 6]&];
    a[n_] := SelectFirst[sp, Length[#] == n && MatchQ[#, {{_Integer, 1} ..}]& ][[1, 1]];
    Table[an = a[n]; Print[n, " ", an]; an, {n, 1, 13}] (* Jean-François Alcover, Nov 21 2018 *)

Extensions

Corrected and extended by Reiner Martin, May 19 2001
More terms from Hugo Pfoertner, Jul 31 2003
a(20)>2^31, a(21)=1444257673. - Hugo Pfoertner, Jul 31 2003
More terms from Jens Kruse Andersen, May 30 2006
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 27 2006