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.

A068209 Primes p of the form 3k - 1 such that there exist nontrivial solutions (x other than 0 or -1 modulo p) to the congruence (x+1)^p - x^p == 1 (mod p^2).

Table of values

n a(n)
1 59
2 83
3 179
4 227
5 419
6 443
7 701
8 857
9 887
10 911
11 929
12 971
13 977
14 1091
15 1109
16 1193
17 1217
18 1223
19 1259
20 1283
21 1289
22 1439
23 1487
24 1493
25 1613
26 1637
27 1811
28 1847
29 1901
30 1997
31 2003
32 2087
33 2243
34 2423
35 2477
36 2579
37 2591
38 2729
39 2777
40 2969
41 3089
42 3137
43 3191
44 3203
45 3251

List of values

[59, 83, 179, 227, 419, 443, 701, 857, 887, 911, 929, 971, 977, 1091, 1109, 1193, 1217, 1223, 1259, 1283, 1289, 1439, 1487, 1493, 1613, 1637, 1811, 1847, 1901, 1997, 2003, 2087, 2243, 2423, 2477, 2579, 2591, 2729, 2777, 2969, 3089, 3137, 3191, 3203, 3251]