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.

A370879 a(n) = 2^n*t + 1 where t is the least x such that there exists an r in the range 2 <= r <= x+1 that is coprime to 2^n*x + 1 and has multiplicative order 2^n modulo 2^n*x + 1.

Table of values

n a(n)
1 3
2 5
3 17
4 193
5 353
6 641
7 769
8 10753
9 10753
10 13313
11 12289
12 114689
13 114689
14 163841
15 786433
16 786433
17 6684673
18 13631489
19 5767169
20 7340033
21 111149057
22 104857601
23 167772161
24 167772161
25 469762049
26 2483027969
27 2281701377
28 3221225473
29 12348030977
30 52613349377

List of values

[3, 5, 17, 193, 353, 641, 769, 10753, 10753, 13313, 12289, 114689, 114689, 163841, 786433, 786433, 6684673, 13631489, 5767169, 7340033, 111149057, 104857601, 167772161, 167772161, 469762049, 2483027969, 2281701377, 3221225473, 12348030977, 52613349377]