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.

A046051 Number of prime factors of Mersenne number M(n) = 2^n - 1 (counted with multiplicity).

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 1
6 3
7 1
8 3
9 2
10 3
11 2
12 5
13 1
14 3
15 3
16 4
17 1
18 6
19 1
20 6
21 4
22 4
23 2
24 7
25 3
26 3
27 3
28 6
29 3
30 7
31 1
32 5
33 4
34 3
35 4
36 10
37 2
38 3
39 4
40 8
41 2
42 8
43 3
44 7
45 6
46 4
47 3
48 10
49 2
50 7
51 5
52 7
53 3
54 9
55 6
56 8
57 4
58 6
59 2
60 13
61 1
62 3
63 7
64 7
65 3
66 9
67 2
68 7
69 4
70 9
71 3
72 14
73 3
74 5
75 7
76 7
77 4
78 8
79 3
80 10
81 6
82 5
83 2
84 14
85 3
86 5
87 6
88 10
89 1
90 13
91 5
92 9
93 3
94 6
95 5
96 13
97 2
98 5
99 8

List of values

[0, 1, 1, 2, 1, 3, 1, 3, 2, 3, 2, 5, 1, 3, 3, 4, 1, 6, 1, 6, 4, 4, 2, 7, 3, 3, 3, 6, 3, 7, 1, 5, 4, 3, 4, 10, 2, 3, 4, 8, 2, 8, 3, 7, 6, 4, 3, 10, 2, 7, 5, 7, 3, 9, 6, 8, 4, 6, 2, 13, 1, 3, 7, 7, 3, 9, 2, 7, 4, 9, 3, 14, 3, 5, 7, 7, 4, 8, 3, 10, 6, 5, 2, 14, 3, 5, 6, 10, 1, 13, 5, 9, 3, 6, 5, 13, 2, 5, 8]