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.

A175257 a(n) is the smallest prime p such that 2^(p-1) == 1 (mod a(1)*...*a(n-1)*p).

Table of values

n a(n)
1 3
2 5
3 13
4 37
5 73
6 109
7 181
8 541
9 1621
10 4861
11 9721
12 19441
13 58321
14 87481
15 379081
16 408241
17 2041201
18 2449441
19 7348321
20 14696641
21 22044961
22 95528161
23 382112641
24 2292675841
25 8024365441
26 40121827201
27 481461926401
28 722192889601
29 2888771558401
30 7944121785601
31 55608852499201
32 111217704998401
33 889741639987201
34 1779483279974401

List of values

[3, 5, 13, 37, 73, 109, 181, 541, 1621, 4861, 9721, 19441, 58321, 87481, 379081, 408241, 2041201, 2449441, 7348321, 14696641, 22044961, 95528161, 382112641, 2292675841, 8024365441, 40121827201, 481461926401, 722192889601, 2888771558401, 7944121785601, 55608852499201, 111217704998401, 889741639987201, 1779483279974401]