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.

A128150 Least k such that n^k mod k = (n-1)^2, or 0 if no such k exists.

Table of values

n a(n)
2 0
3 41459
4 35
5 9569200211
6 2673413
7 10596486211
8 1885511821439
9 235
10 12722173
11 1971782729
12 133617287
13 14873
14 1465
15 1606870609
16 4247
17 129015968122421
18 526673
19 835
20 1079115301
21 12148589879
22 12351683
23 36947690849
24 6385
25 5809

List of values

[0, 41459, 35, 9569200211, 2673413, 10596486211, 1885511821439, 235, 12722173, 1971782729, 133617287, 14873, 1465, 1606870609, 4247, 129015968122421, 526673, 835, 1079115301, 12148589879, 12351683, 36947690849, 6385, 5809]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.