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.

A336882 a(0) = 1; for k >= 0, 0 <= i < 2^k, a(2^k + i) = m_k * a(i), where m_k is the least odd number not in terms 0..2^k - 1.

Table of values

n a(n)
0 1
1 3
2 5
3 15
4 7
5 21
6 35
7 105
8 9
9 27
10 45
11 135
12 63
13 189
14 315
15 945
16 11
17 33
18 55
19 165
20 77
21 231
22 385
23 1155
24 99
25 297
26 495
27 1485
28 693
29 2079
30 3465
31 10395
32 13
33 39
34 65
35 195
36 91
37 273
38 455
39 1365
40 117
41 351
42 585
43 1755
44 819
45 2457
46 4095
47 12285
48 143
49 429
50 715
51 2145
52 1001

List of values

[1, 3, 5, 15, 7, 21, 35, 105, 9, 27, 45, 135, 63, 189, 315, 945, 11, 33, 55, 165, 77, 231, 385, 1155, 99, 297, 495, 1485, 693, 2079, 3465, 10395, 13, 39, 65, 195, 91, 273, 455, 1365, 117, 351, 585, 1755, 819, 2457, 4095, 12285, 143, 429, 715, 2145, 1001]