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.

A347906 Numbers k such that 2^(2*k-1) == 1 (mod k).

Table of values

n a(n)
1 1
2 80519
3 107663
4 1284113
5 1510313
6 3933023
7 4557713
8 24849833
9 71871113
10 80646143
11 98058097
12 104832833
13 106694033
14 146987033
15 168204191
16 188997463
17 205428713
18 332693873
19 333681761
20 336327863
21 380284847
22 533039513
23 552913169
24 711999113
25 725943719
26 805031663
27 1000519033
28 1069441313
29 1476327353
30 1610020913

List of values

[1, 80519, 107663, 1284113, 1510313, 3933023, 4557713, 24849833, 71871113, 80646143, 98058097, 104832833, 106694033, 146987033, 168204191, 188997463, 205428713, 332693873, 333681761, 336327863, 380284847, 533039513, 552913169, 711999113, 725943719, 805031663, 1000519033, 1069441313, 1476327353, 1610020913]