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.

A352061 Numbers n = 2^m * q, m > 0 and q > 1 odd, where the smallest odd divisor p > 1 is the m-th Mersenne prime 2^(m+1) - 1.

Table of values

n a(n)
1 6
2 18
3 28
4 30
5 42
6 54
7 66
8 78
9 90
10 102
11 114
12 126
13 138
14 150
15 162
16 174
17 186
18 196
19 198
20 210
21 222
22 234
23 246
24 258
25 270
26 282
27 294
28 306
29 308
30 318
31 330
32 342
33 354
34 364
35 366
36 378
37 390
38 402
39 414
40 426
41 438
42 450
43 462
44 474
45 476
46 486
47 496
48 498
49 510
50 522
51 532
52 534
53 546
54 558
55 570
56 582
57 594

List of values

[6, 18, 28, 30, 42, 54, 66, 78, 90, 102, 114, 126, 138, 150, 162, 174, 186, 196, 198, 210, 222, 234, 246, 258, 270, 282, 294, 306, 308, 318, 330, 342, 354, 364, 366, 378, 390, 402, 414, 426, 438, 450, 462, 474, 476, 486, 496, 498, 510, 522, 532, 534, 546, 558, 570, 582, 594]

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

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