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.

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

Original entry on oeis.org

13, 661, 8317, 12829, 586153, 1081417, 7790917, 7790917, 370861009, 370861009, 370861009, 5637496849, 289391626057, 469257742237, 628337233501, 84424712545429, 155494152002017, 341821313785729
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, jHarvey P. Dale, Dec 24 2020 *)
  • PARI
    {i=n=1; while(1,j=0; while(j
    				

Extensions

Edited by Dean Hickerson, Mar 06 2002
a(12)-a(15) from Giovanni Resta, Feb 18 2006
a(16)-a(18) from Giovanni Resta, Aug 04 2013