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.

A316907 Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.

Table of values

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

List of values

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