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.

A212552 Smallest prime factor of p^p - 1 that is congruent to 1 modulo p where p = prime(n).

Table of values

n a(n)
1 3
2 13
3 11
4 29
5 15797
6 53
7 10949
8 109912203092239643840221
9 461
10 59
11 568972471024107865287021434301977158534824481
12 149
13 83
14 173
15 1693
16 107
17 709
18 977
19 269
20 105649
21 293
22 317
23 2657
24 179
25 389
26 607
27 1237
28 137122213
29 2617
30 227
31 509
32 1049
33 1097
34 557
35 1193
36 2417
37 86351

List of values

[3, 13, 11, 29, 15797, 53, 10949, 109912203092239643840221, 461, 59, 568972471024107865287021434301977158534824481, 149, 83, 173, 1693, 107, 709, 977, 269, 105649, 293, 317, 2657, 179, 389, 607, 1237, 137122213, 2617, 227, 509, 1049, 1097, 557, 1193, 2417, 86351]

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

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