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.

A353865 Number of complete rucksack partitions of n. Partitions whose weak run-sums are distinct and cover an initial interval of nonnegative integers.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 5, 2, 3, 4, 3, 2, 4, 3, 3, 4, 4, 3, 4, 3, 4, 5, 5, 4, 6, 4, 6, 5, 4, 5, 6, 5, 6, 7, 6, 5, 9, 6, 6, 7, 6, 8, 9, 6, 6, 8, 9, 7, 9, 9, 7, 10, 9, 8, 13, 7, 10, 11, 8, 9, 10, 11, 12, 9, 11, 9, 15, 12, 12, 19, 13, 16, 16]