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.

A089053 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2.

Table of values

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

List of values

[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 1, 1, 1, 2, 2, 1, 1, 1, 0, 1, 2, 2, 2, 2, 2, 1, 1, 1, 0, 0, 1, 2, 2, 2, 2, 2, 1, 1, 1, 0, 1, 2, 2, 3, 3, 2, 2, 2, 1, 1, 1, 0, 0, 1, 2, 2, 3, 3, 2, 2, 2, 1, 1, 1, 0, 0, 1, 3, 3, 3, 4, 3, 2, 2, 2, 1, 1, 1]