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.

A297414 Numbers k such that 2^m == 2 (mod m*(m+1)), where m = A019320(k).

Table of values

n a(n)
1 1
2 4
3 9
4 12
5 25
6 36
7 40
8 52
9 80
10 92
11 124
12 150
13 208
14 306
15 361
16 630
17 656
18 1648
19 1780
20 2508
21 3300
22 3540
23 5728
24 6260
25 6450
26 7500
27 10820
28 12656
29 14076
30 14132
31 18836
32 20960
33 23456
34 24272
35 35280
36 43136

List of values

[1, 4, 9, 12, 25, 36, 40, 52, 80, 92, 124, 150, 208, 306, 361, 630, 656, 1648, 1780, 2508, 3300, 3540, 5728, 6260, 6450, 7500, 10820, 12656, 14076, 14132, 18836, 20960, 23456, 24272, 35280, 43136]