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.

A190213 Integers m such that m divides (2^m-2)^2 and (m-2)^((k-1)*(1+k*(m-1))) == 1 (mod k), where k = 2^m - 1.

Table of values

n a(n)
1 1
2 3
3 4
4 5
5 7
6 13
7 17
8 19
9 31
10 61
11 89
12 107
13 127
14 521
15 607
16 1279
17 2203
18 2281
19 3217
20 4253
21 4423
22 9689
23 9941
24 11213
25 19937
26 21701
27 23209
28 44497
29 86243
30 110503
31 132049
32 216091
33 756839

List of values

[1, 3, 4, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839]