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.

A343321 Number of knapsack partitions of n with largest part 5.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 1, 4, 3, 5, 5, 4, 4, 6, 5, 7, 2, 6, 5, 8, 5, 4, 6, 7, 6, 8, 2, 8, 6, 7, 7, 5, 5, 8, 7, 8, 2, 8, 6, 9, 6, 3, 7, 9, 5, 8, 3, 8, 6, 8, 6, 5, 6, 7, 7, 9, 1, 8, 7, 8, 6, 4, 6, 9, 6, 7, 3, 9, 5, 8, 7, 4, 6, 8, 6, 9, 2, 7, 7, 9, 5, 4, 7]