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.

A176033 Numbers k such that 2^(2k-1) == 2 (mod 2k) and such that 2^(k-1) != 1 (mod k).

Table of values

n a(n)
1 15
2 85
3 91
4 435
5 451
6 703
7 1247
8 1271
9 1581
10 1695
11 1891
12 2071
13 3133
14 3367
15 3683
16 4795
17 4859
18 5551
19 6643
20 8695
21 9061
22 9131
23 9211
24 9605
25 9919
26 12403
27 13019
28 14351
29 14701
30 15051
31 15211
32 16021
33 16471
34 19669
35 20191
36 20485
37 24727
38 25351
39 26335
40 26599
41 27511
42 28645

List of values

[15, 85, 91, 435, 451, 703, 1247, 1271, 1581, 1695, 1891, 2071, 3133, 3367, 3683, 4795, 4859, 5551, 6643, 8695, 9061, 9131, 9211, 9605, 9919, 12403, 13019, 14351, 14701, 15051, 15211, 16021, 16471, 19669, 20191, 20485, 24727, 25351, 26335, 26599, 27511, 28645]