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.

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

Original entry on oeis.org

7, 199, 199, 32443, 180799, 180799, 4338787, 84885631, 472798219, 1786054267, 6024282871, 64791932287, 592175010019, 6265824724519, 7816088451907, 24660781037467
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.

Crossrefs

Programs

  • Mathematica
    For[i=n=1, True, Null, For[j=0, j
    				
  • 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
a(16) from Giovanni Resta, Aug 04 2013