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.

A250396 a(n) is the smallest prime greater than 2^n such that 2 is a primitive root modulo a(n).

Table of values

n a(n)
0 3
1 3
2 5
3 11
4 19
5 37
6 67
7 131
8 269
9 523
10 1061
11 2053
12 4099
13 8219
14 16421
15 32771
16 65539
17 131213
18 262147
19 524309
20 1048589
21 2097211
22 4194371
23 8388619
24 16777259
25 33554467
26 67108933
27 134217773
28 268435459
29 536871019
30 1073741827
31 2147483659
32 4294967357
33 8589934621
34 17179869269
35 34359738421
36 68719476851
37 137438953741

List of values

[3, 3, 5, 11, 19, 37, 67, 131, 269, 523, 1061, 2053, 4099, 8219, 16421, 32771, 65539, 131213, 262147, 524309, 1048589, 2097211, 4194371, 8388619, 16777259, 33554467, 67108933, 134217773, 268435459, 536871019, 1073741827, 2147483659, 4294967357, 8589934621, 17179869269, 34359738421, 68719476851, 137438953741]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.