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.

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

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 0
8 1
9 1
10 0
11 1
12 1
13 1
14 1
15 0
16 0
17 1
18 1
19 1
20 1
21 0
22 0
23 1
24 2
25 1
26 1
27 1
28 0
29 0
30 0
31 1
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 0
47 1
48 1
49 1
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 0
68 0
69 1
70 2
71 2
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 0
94 1
95 2
96 2
97 3
98 3
99 2
100 2
101 2
102 1
103 1
104 1

List of values

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