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.

A344310 Number of knapsack partitions of n with largest part 4.

Table of values

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

List of values

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