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.

A309840 If n = Sum (2^e_k) then a(n) = Product (Fibonacci(e_k + 3)).

Table of values

n a(n)
0 1
1 2
2 3
3 6
4 5
5 10
6 15
7 30
8 8
9 16
10 24
11 48
12 40
13 80
14 120
15 240
16 13
17 26
18 39
19 78
20 65
21 130
22 195
23 390
24 104
25 208
26 312
27 624
28 520
29 1040
30 1560
31 3120
32 21
33 42
34 63
35 126
36 105
37 210
38 315
39 630
40 168
41 336
42 504
43 1008
44 840
45 1680
46 2520
47 5040
48 273
49 546
50 819
51 1638
52 1365
53 2730
54 4095
55 8190

List of values

[1, 2, 3, 6, 5, 10, 15, 30, 8, 16, 24, 48, 40, 80, 120, 240, 13, 26, 39, 78, 65, 130, 195, 390, 104, 208, 312, 624, 520, 1040, 1560, 3120, 21, 42, 63, 126, 105, 210, 315, 630, 168, 336, 504, 1008, 840, 1680, 2520, 5040, 273, 546, 819, 1638, 1365, 2730, 4095, 8190]