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.

A358315 Primes p == 1 (mod 3) such that there exists 1 <= x <= p-2 such that (x+1)^p - x^p == 1 (mod p^2) and that p does not divide x^2 + x + 1.

Table of values

n a(n)
1 79
2 193
3 337
4 421
5 457
6 547
7 601
8 619
9 691
10 757
11 787
12 907
13 1039
14 1093
15 1231
16 1237
17 1303
18 1489
19 1531
20 1657
21 1993
22 2089
23 2113
24 2251
25 2311
26 2377
27 2389
28 2437
29 2539
30 2647
31 2659
32 2713
33 2731
34 2749
35 3001
36 3037
37 3109
38 3229
39 3319
40 3331
41 3511
42 4003
43 4177
44 4243
45 4273
46 4339
47 4447

List of values

[79, 193, 337, 421, 457, 547, 601, 619, 691, 757, 787, 907, 1039, 1093, 1231, 1237, 1303, 1489, 1531, 1657, 1993, 2089, 2113, 2251, 2311, 2377, 2389, 2437, 2539, 2647, 2659, 2713, 2731, 2749, 3001, 3037, 3109, 3229, 3319, 3331, 3511, 4003, 4177, 4243, 4273, 4339, 4447]