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.

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 0, 2, 0, 1, 1, 2, 1, 0, 1, 0, 4, 0, 2, 0, 1, 1, 5, 0, 2, 2, 0, 1, 0, 7, 0, 2, 0, 5, 0, 1, 1, 8, 1, 2, 2, 6, 1, 0, 1, 0, 11, 0, 4, 0, 12, 0, 2, 0, 1, 1, 12, 0, 5, 4, 15, 0, 2, 2, 0, 1, 0, 15, 0, 5, 0, 28, 0, 2, 0, 5, 0, 1, 1, 17, 1, 5, 5, 35, 0, 2, 2, 6, 2]