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.

A307432 Number T(n,k) of partitions of n into parts whose bitwise AND equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 3, 2, 1, 0, 0, 1, 5, 3, 1, 1, 0, 0, 1, 9, 4, 1, 0, 0, 0, 0, 1, 11, 6, 3, 0, 1, 0, 0, 0, 1, 18, 6, 3, 1, 1, 0, 0, 0, 0, 1, 27, 8, 3, 1, 1, 1, 0, 0, 0, 0, 1, 38, 11, 4, 0, 2, 0, 0, 0, 0, 0, 0, 1, 53, 13, 6, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1]