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.

A046886 Number of divisors d of 2n satisfying (d+1) = prime or number of prime factors of the denominator of the even Bernoulli numbers.

Table of values

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

List of values

[2, 3, 3, 3, 3, 5, 2, 4, 4, 4, 3, 5, 2, 4, 5, 4, 2, 7, 2, 5, 4, 4, 3, 6, 3, 4, 4, 4, 3, 8, 2, 4, 5, 3, 4, 8, 2, 3, 4, 6, 3, 7, 2, 5, 6, 4, 2, 7, 2, 5, 4, 4, 3, 8, 4, 6, 3, 4, 2, 9, 2, 3, 6, 4, 4, 7, 2, 4, 5, 6, 2, 9, 2, 4, 6, 3, 3, 8, 2, 6, 5, 4, 3, 7, 3, 4, 4, 6, 3, 11, 2, 4, 3, 3, 4, 8, 2, 5, 7, 6, 2, 6, 2, 5]