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.

A326017 Triangle read by rows where T(n,k) is the number of knapsack partitions of n with maximum k.

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 2, 1, 1, 0, 1, 1, 1, 2, 1, 1, 0, 1, 1, 2, 3, 2, 1, 1, 0, 1, 1, 2, 1, 3, 2, 1, 1, 0, 1, 1, 2, 2, 4, 3, 2, 1, 1, 0, 1, 1, 2, 3, 1, 4, 3, 2, 1, 1, 0, 1, 1, 3, 3, 4, 6, 4, 3, 2, 1, 1, 0, 1, 1, 1, 1, 3, 1, 6, 4]