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.

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

Original entry on oeis.org

11, 467, 1499, 16763, 260339, 2003387, 7722419, 20221283, 927161471, 4284484931, 7355362139, 84805717127, 478527373859, 2046207697631, 7302359785151, 21104656617827, 21104656617827
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, 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)-a(17) from Giovanni Resta, Aug 04 2013