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.

A380831 Numbers k such that k^(k + 1) == k + 1 (mod 2*k + 1) while 2*k+1 is not prime.

Table of values

n a(n)
1 1023
2 1638
3 14670
4 21399
5 24570
6 40290
7 44178
8 45375
9 52326
10 98046
11 128499
12 135975
13 157410
14 229494
15 244998
16 257223
17 370875
18 400302
19 419430
20 436590
21 458163
22 502326
23 625974
24 686826
25 754854
26 839270
27 905786
28 993510
29 1102983
30 1134546
31 1142226
32 1152083
33 1193898
34 1373238
35 1374011

List of values

[1023, 1638, 14670, 21399, 24570, 40290, 44178, 45375, 52326, 98046, 128499, 135975, 157410, 229494, 244998, 257223, 370875, 400302, 419430, 436590, 458163, 502326, 625974, 686826, 754854, 839270, 905786, 993510, 1102983, 1134546, 1142226, 1152083, 1193898, 1373238, 1374011]