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.

A072624 a(n) = prime(n^2) mod n^2.

Original entry on oeis.org

0, 3, 5, 5, 22, 7, 31, 55, 14, 41, 56, 107, 164, 17, 77, 83, 145, 199, 271, 341, 437, 73, 100, 179, 262, 319, 416, 519, 594, 697, 846, 993, 25, 93, 131, 259, 369, 497, 575, 699, 879, 989, 1085, 1259, 1409, 1533, 1799, 1961, 2183, 2307, 2519, 23, 188, 329, 514
Offset: 1

Views

Author

Labos Elemer, Jun 28 2002

Keywords

Examples

			For n = 10: a(10) = prime(100) mod 100 = 541 mod 100 = 41.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Mod[Prime[n^2], n^2]; Array[a, 100] (* Amiram Eldar, Mar 17 2025 *)
  • PARI
    a(n) = prime(n^2) % (n^2); \\ Amiram Eldar, Mar 17 2025

Formula

a(n) = A004648(n^2).