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.

A316906 Numbers k such that 2^(k-1) == 1 (mod k) and lpf(k)-1 does not divide k-1.

Table of values

n a(n)
1 7957
2 23377
3 30889
4 35333
5 42799
6 49981
7 60787
8 91001
9 129889
10 150851
11 162193
12 164737
13 241001
14 249841
15 253241
16 256999
17 280601
18 318361
19 387731
20 452051
21 481573
22 556169
23 580337
24 617093
25 665333
26 722201
27 838861
28 877099
29 1016801
30 1251949
31 1252697
32 1325843
33 1507963

List of values

[7957, 23377, 30889, 35333, 42799, 49981, 60787, 91001, 129889, 150851, 162193, 164737, 241001, 249841, 253241, 256999, 280601, 318361, 387731, 452051, 481573, 556169, 580337, 617093, 665333, 722201, 838861, 877099, 1016801, 1251949, 1252697, 1325843, 1507963]