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.

A136034 a(n) = smallest number k such that number of distinct prime factors of 2^k-1 is exactly n.

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 12
5 20
6 24
7 40
8 36
9 48
10 88
11 60
12 72
13 150
14 132
15 120
16 156
17 144
18 200
19 204
20 210
21 180
22 324
23 476
24 288
25 300
26 432
27 396
28 480
29 360
30 468
31 576
32 700
33 504
34 420
35 648
36 540
37 660
38 792
39 720

List of values

[1, 2, 4, 8, 12, 20, 24, 40, 36, 48, 88, 60, 72, 150, 132, 120, 156, 144, 200, 204, 210, 180, 324, 476, 288, 300, 432, 396, 480, 360, 468, 576, 700, 504, 420, 648, 540, 660, 792, 720]