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.

A215609 Smallest prime p congruent to 1 modulo prime(10^n).

Original entry on oeis.org

3, 59, 9739, 63353, 209459, 15596509, 154858631, 1794246731, 4076149487, 45603526979, 11092303227413, 93864728285579, 1319833868136653, 11656098322067917, 27803086068196217, 1781976386163140977, 32382366940106296979, 100447117955224696057, 707388643757314709297
Offset: 0

Views

Author

Zak Seidov, Aug 17 2012

Keywords

Examples

			a(0) = 3 because p = prime(1) = 2, 3 = 1+p.
a(1) = 59 because p = prime(10) = 29, 59 = 1+2*p.
a(2) = 9739 because p = prime(10) = 29, 59 = 1+18*p.
		

Crossrefs

Programs

  • Mathematica
    a[n_]:=(If[n<2,3,p=Prime[n];r=2p+1;While[!PrimeQ[r],r=r+2p];r]);Table[a[10^n],{n,0,12}]

Formula

a(n) = A035095(10^n).

Extensions

a(13)-a(18) from Amiram Eldar, Apr 30 2024