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.

Previous Showing 11-12 of 12 results.

A092049 Numbers n such that prime(n) == -7 (mod n).

Original entry on oeis.org

1, 2, 3, 24, 29, 30, 170, 171, 173, 176, 178, 184, 185, 186, 2616, 6462, 6467, 6470, 40090, 40115, 40118, 40120, 637330, 10553400, 10553441, 10553451, 10553458, 10553503, 10553548, 27067046, 27067134, 27067136, 69709702, 69709704, 69709716
Offset: 1

Views

Author

Robert G. Wilson v, Feb 18 2004

Keywords

Crossrefs

Programs

  • Mathematica
    NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 7, Print[n]], {n, 1, 10^9}]

Extensions

Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004

A171434 Primes that are congruent to 7 mod n, where n is the index of the prime.

Original entry on oeis.org

2, 3, 7, 13, 61, 151, 397, 1153, 64567, 64577, 480967, 480979, 9559867, 9559897, 9560167, 189961657, 189961819, 189962593, 189963043, 189964321, 189969379, 514272779, 514275401, 1394193607, 1394194727, 1394198807, 10246936003, 75370121191, 75370121767, 75370121839
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    Prime@ Select[Range[10^5], Mod[Prime[#] - 7, #] == 0 &] (* Giovanni Resta, Feb 25 2020 *)

Extensions

Missing a(1)-a(4), a(16) and beyond from Giovanni Resta, Feb 23 2020
Previous Showing 11-12 of 12 results.