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.

A056035 Numbers k such that k^30 == 1 (mod 31^2).

Original entry on oeis.org

1, 115, 117, 145, 229, 235, 333, 338, 374, 388, 414, 430, 439, 440, 448, 513, 521, 522, 531, 547, 573, 587, 623, 628, 726, 732, 816, 844, 846, 960, 962, 1076, 1078, 1106, 1190, 1196, 1294, 1299, 1335, 1349, 1375, 1391, 1400, 1401, 1409, 1474, 1482, 1483
Offset: 1

Views

Author

Robert G. Wilson v, Jun 08 2000

Keywords

Crossrefs

Programs

  • Mathematica
    x=31; Select[ Range[ 2000 ], PowerMod[ #, x-1, x^2 ]==1& ]

Formula

From Mike Sheppard, Feb 20 2025 : (Start)
a(n) = a(n-1) + a(n-30) - a(n-31).
a(n) = a(n-30) + 31^2.
a(n) ~ (31^2/30)*n. (End)