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.

A374717 For n a power of 2, a(n) = n. Otherwise let k = n - 2^j (> 0) where 2^j is the greatest power of 2 not exceeding n, then a(n) = least novel m*a(k); m a term in A033844.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 7
6 6
7 9
8 8
9 19
10 14
11 21
12 12
13 49
14 18
15 27
16 16
17 53
18 38
19 57
20 28
21 133
22 42
23 63
24 24
25 361
26 98
27 147
28 36
29 343
30 54
31 81
32 32
33 131
34 106
35 159
36 76
37 371
38 114
39 171
40 56
41 1007
42 266
43 399
44 84
45 931
46 126
47 189
48 48
49 2809
50 722
51 1083
52 196
53 2527
54 294
55 441
56 72
57 6859
58 686
59 1029
60 108
61 2401
62 162
63 243
64 64
65 311

List of values

[1, 2, 3, 4, 7, 6, 9, 8, 19, 14, 21, 12, 49, 18, 27, 16, 53, 38, 57, 28, 133, 42, 63, 24, 361, 98, 147, 36, 343, 54, 81, 32, 131, 106, 159, 76, 371, 114, 171, 56, 1007, 266, 399, 84, 931, 126, 189, 48, 2809, 722, 1083, 196, 2527, 294, 441, 72, 6859, 686, 1029, 108, 2401, 162, 243, 64, 311]