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.

A245541 Write n>=1 as either n=2^k-2^r with 0 <= r <= k-1, in which case a(2^k-2^r)=(k-r)*(k-r+1)/2, or as n=2^k-2^r+j with 2 <= r <= k-1, 1 <= j < 2^r-1, in which case a(2^k-2^r+j)=((k-r)*(k-r+1)/2)*a(j).

Table of values

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

List of values

[1, 1, 3, 1, 1, 3, 6, 1, 1, 1, 3, 3, 3, 6, 10, 1, 1, 1, 3, 1, 1, 3, 6, 3, 3, 3, 9, 6, 6, 10, 15, 1, 1, 1, 3, 1, 1, 3, 6, 1, 1, 1, 3, 3, 3, 6, 10, 3, 3, 3, 9, 3, 3, 9, 18, 6, 6, 6, 18, 10, 10, 15, 21, 1, 1, 1, 3, 1, 1, 3, 6, 1, 1, 1, 3, 3, 3, 6, 10, 1, 1, 1, 3, 1, 1, 3, 6, 3, 3, 3, 9, 6, 6, 10, 15]