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.

A145038 Numbers to which Mersenne primes 2^p-1 can be congruent mod k! (for k > 1).

Table of values

n a(n)
1 1
2 3
3 7
4 31
5 127
6 271
7 607
8 2047
9 3151
10 8191
11 10111
12 40447
13 42367
14 48511
15 50431
16 80767
17 88831
18 90751
19 121087
20 131071
21 161407
22 163327
23 169471
24 171391
25 201727
26 209791
27 211711
28 243967
29 250111
30 282367
31 290431
32 292351
33 322687
34 324607
35 332671

List of values

[1, 3, 7, 31, 127, 271, 607, 2047, 3151, 8191, 10111, 40447, 42367, 48511, 50431, 80767, 88831, 90751, 121087, 131071, 161407, 163327, 169471, 171391, 201727, 209791, 211711, 243967, 250111, 282367, 290431, 292351, 322687, 324607, 332671]