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.

A068234 a(n) is the smallest prime p such that p and the next n-1 primes are all == 5 (mod 12).

Original entry on oeis.org

5, 509, 4397, 42509, 647417, 647417, 1248869, 13175609, 234946997, 1039154933, 7114719473, 32021552837, 32021552837, 1237381737257, 2904797643617, 2904797643617, 2904797643617
Offset: 1

Views

Author

Ferenc Adorjan (fadorjan(AT)freemail.hu), Feb 22 2002

Keywords

Comments

Dickson's conjecture implies that a(n) exists for all n.
a(18) > 4*10^14. - Giovanni Resta, Aug 04 2013

Crossrefs

Programs

  • Mathematica
    For[i=n=1, True, Null, For[j=0, jHarvey P. Dale, Feb 02 2022 *)
  • PARI
    {i=n=1; while(1,j=0; while(j
    				

Extensions

Edited by Dean Hickerson, Mar 06 2002
More terms from Giovanni Resta, Feb 18 2006