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.

A083391 n-th Payam number E_{-}(n), defined as the smallest positive odd integer k such that for every positive integer n, the number k*2^n-1 is not divisible by any primes p such that the multiplicative order of 2 mod p is less than or equal to e.

Table of values

n a(n)
2 3
3 3
4 45
5 45
6 45
7 45
8 45
9 45
10 2145
11 2805
12 92235
13 92235
14 92235
15 92235
16 92235
17 92235
18 529815
19 529815
20 529815
21 529815
22 529815
23 529815
24 529815
25 529815
26 1426425
27 1426425
28 247016055
29 247016055
30 247016055
31 247016055

List of values

[3, 3, 45, 45, 45, 45, 45, 45, 2145, 2805, 92235, 92235, 92235, 92235, 92235, 92235, 529815, 529815, 529815, 529815, 529815, 529815, 529815, 529815, 1426425, 1426425, 247016055, 247016055, 247016055, 247016055]