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.

A323214 Composite numbers k such that p^(k-1) == 1 (mod k) for every prime p strongly prime to k.

Table of values

n a(n)
1 4
2 6
3 561
4 1105
5 1729
6 2465
7 2821
8 6601
9 8911
10 10585
11 15841
12 29341
13 41041
14 46657
15 52633
16 62745
17 63973
18 75361
19 101101
20 115921
21 126217
22 162401
23 172081
24 188461
25 252601
26 278545
27 294409
28 314821
29 334153
30 340561
31 399001
32 410041
33 449065
34 488881
35 512461
36 530881
37 552721

List of values

[4, 6, 561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, 29341, 41041, 46657, 52633, 62745, 63973, 75361, 101101, 115921, 126217, 162401, 172081, 188461, 252601, 278545, 294409, 314821, 334153, 340561, 399001, 410041, 449065, 488881, 512461, 530881, 552721]