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.

A264034 Triangle read by rows: T(n,k) (n>=0, 0<=k<=A161680(n)) is the number of integer partitions of n with weighted sum k.

Table of values

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

List of values

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