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.

A332382 If n = Sum (2^e_k) then a(n) = Product (prime(e_k + 2)).

Table of values

n a(n)
0 1
1 3
2 5
3 15
4 7
5 21
6 35
7 105
8 11
9 33
10 55
11 165
12 77
13 231
14 385
15 1155
16 13
17 39
18 65
19 195
20 91
21 273
22 455
23 1365
24 143
25 429
26 715
27 2145
28 1001
29 3003
30 5005
31 15015
32 17
33 51
34 85
35 255
36 119
37 357
38 595
39 1785
40 187
41 561
42 935
43 2805
44 1309
45 3927
46 6545
47 19635
48 221
49 663
50 1105
51 3315
52 1547
53 4641
54 7735
55 23205

List of values

[1, 3, 5, 15, 7, 21, 35, 105, 11, 33, 55, 165, 77, 231, 385, 1155, 13, 39, 65, 195, 91, 273, 455, 1365, 143, 429, 715, 2145, 1001, 3003, 5005, 15015, 17, 51, 85, 255, 119, 357, 595, 1785, 187, 561, 935, 2805, 1309, 3927, 6545, 19635, 221, 663, 1105, 3315, 1547, 4641, 7735, 23205]