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.

A128148 a(n) = least k such that 3^k mod k = 2^n.

Table of values

n a(n)
0 2
1 2929
2 41459
3 2352527
4 144937
5 1055
6 1829903
7 7316185805
8 114491
9 3146746271
10 5028467
11 20299
12 69609309001
13 129433
14 15307006153
15 2149705
16 66469
17 559182815
18 18429503
19 4529951
20 7094711
21 83591212702535
22 1251548749
23 38088889

List of values

[2, 2929, 41459, 2352527, 144937, 1055, 1829903, 7316185805, 114491, 3146746271, 5028467, 20299, 69609309001, 129433, 15307006153, 2149705, 66469, 559182815, 18429503, 4529951, 7094711, 83591212702535, 1251548749, 38088889]