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.

A187787 Numbers k such that 2^(k+1) == 1 (mod k).

Table of values

n a(n)
1 1
2 3
3 15
4 35
5 119
6 255
7 455
8 1295
9 2555
10 2703
11 3815
12 3855
13 4355
14 5543
15 6479
16 8007
17 9215
18 10439
19 10619
20 11951
21 16211
22 22895
23 23435
24 26319
25 26795
26 27839
27 28679
28 35207
29 43055
30 44099
31 47519
32 47879
33 49679
34 51119
35 57239
36 61919
37 62567
38 63167
39 63935
40 65535
41 74447
42 79055

List of values

[1, 3, 15, 35, 119, 255, 455, 1295, 2555, 2703, 3815, 3855, 4355, 5543, 6479, 8007, 9215, 10439, 10619, 11951, 16211, 22895, 23435, 26319, 26795, 27839, 28679, 35207, 43055, 44099, 47519, 47879, 49679, 51119, 57239, 61919, 62567, 63167, 63935, 65535, 74447, 79055]