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.

A092045 Numbers n such that prime(n) == -3 (mod n).

Original entry on oeis.org

1, 2, 25, 26, 68, 1054, 1058, 6472, 251723, 4124468, 69709727, 69709942, 465769817, 465769835, 1208198860, 8179002154, 8179002176, 8179002178, 145935689360, 145935689369, 145935689392, 145935689393
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 - 3, Print[n]], {n, 1, 10^9}]
    Join[{1,2},Select[Range[5 10^6],Mod[Prime[#],#]==#-3&]] (* Harvey P. Dale, Mar 29 2023 *)

Extensions

Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
a(13)-a(22) from Robert G. Wilson v, Feb 22 2006

A171430 Primes that are congruent to 3 mod n, where n is the index of the prime.

Original entry on oeis.org

2, 3, 7, 17, 19, 127, 131, 139, 373, 383, 8419, 64553, 175211, 3523901, 3524713, 70115789, 514273231, 514275283, 1394194363, 1394197423, 1394197543, 1394198683, 1394198863, 1394199083, 1394199263, 1394199283, 10246935823, 204475053103, 4086199302923, 11091501631097
Offset: 1

Views

Author

Keywords

Examples

			Mod(7,4)=3, Mod(17,7)=3.
		

Crossrefs

Programs

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

Extensions

a(14) from Harvey P. Dale, Oct 21 2016
Terms a(1)-a(2), a(17) and beyond from Giovanni Resta, Feb 23 2020
Previous Showing 11-12 of 12 results.