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.

A073265 Table T(n,k) (listed antidiagonalwise in order T(1,1), T(2,1), T(1,2), T(3,1), T(2,2), ...) giving the number of compositions (ordered partitions) of n into exactly k powers of 2.

Table of values

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

List of values

[1, 1, 0, 0, 1, 0, 1, 2, 0, 0, 0, 1, 1, 0, 0, 0, 2, 3, 0, 0, 0, 0, 2, 3, 1, 0, 0, 0, 1, 0, 4, 4, 0, 0, 0, 0, 0, 1, 6, 6, 1, 0, 0, 0, 0, 0, 2, 3, 8, 5, 0, 0, 0, 0, 0, 0, 2, 3, 13, 10, 1, 0, 0, 0, 0, 0, 0, 0, 6, 12, 15, 6, 0, 0, 0, 0, 0, 0, 0, 2, 6, 10, 25, 15, 1, 0, 0, 0, 0, 0, 0, 0, 0, 4, 16, 31, 26, 7, 0, 0, 0, 0, 0, 0, 0]