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.

Showing 1-2 of 2 results.

A213334 Primes p such that (k+1)*p^2 - k is prime for k=1..8.

Original entry on oeis.org

75902670689, 84005465699, 188745495049, 220260667439, 314987199911, 1970532645509, 2368000666921, 3702971171899, 3886185845431, 4117783215701, 4166366916251, 6213125459729, 7768065083591, 7946042954849, 8788172678669, 11387502711311, 14643617926211
Offset: 1

Views

Author

Zak Seidov, Jun 08 2012

Keywords

Comments

The square of each term is congruent to 1 (mod 9240).
Note that for each p, (k+1)*p^2 - k (k=1..8) gives 8 primes in arithmetic progression with difference d = p^2 - 1.

Crossrefs

Extensions

a(6)-a(17) from Tyler Busby, Jan 09 2023

A213162 Smallest prime p such that (k+1)*p^2-k are prime for k=1..n.

Original entry on oeis.org

2, 199, 409, 17569, 981091, 3918251, 1329433951, 75902670689, 45048280453021
Offset: 1

Views

Author

Zak Seidov, Jun 06 2012

Keywords

Comments

a(1..8) are the first terms correspondingly in A106483, A213078, A213079, A213107, A213125, A213159, A213161, A213334.

Programs

  • PARI
    a(n) = {my(p = 2); until (ok, ok = 1; for (k = 1, n, if (! isprime((k+1)*p^2-k), ok = 0; break;);); if (!ok, p = nextprime(p+1);)); return (p);}  \\ Michel Marcus, Apr 19 2013

Extensions

a(9) from Tyler Busby, Jan 11 2023
Showing 1-2 of 2 results.