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.

A156787 Composite integers n such that 2^{n-1}=1 mod s(n), where s(n) is the sum of the distinct prime factors of n.

Table of values

n a(n)
1 9
2 10
3 25
4 27
5 40
6 49
7 81
8 100
9 105
10 116
11 121
12 125
13 160
14 169
15 243
16 250
17 289
18 343
19 361
20 400
21 525
22 529
23 561
24 568
25 625
26 640
27 729
28 805
29 841
30 945
31 961
32 1000
33 1001
34 1018
35 1045
36 1105
37 1309
38 1331
39 1369
40 1596
41 1600
42 1681
43 1729
44 1849
45 1856
46 1881
47 2001
48 2187
49 2197
50 2205

List of values

[9, 10, 25, 27, 40, 49, 81, 100, 105, 116, 121, 125, 160, 169, 243, 250, 289, 343, 361, 400, 525, 529, 561, 568, 625, 640, 729, 805, 841, 945, 961, 1000, 1001, 1018, 1045, 1105, 1309, 1331, 1369, 1596, 1600, 1681, 1729, 1849, 1856, 1881, 2001, 2187, 2197, 2205]