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.

A326035 Number of uniform knapsack partitions of n.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 4
6 6
7 6
8 9
9 10
10 12
11 12
12 17
13 16
14 20
15 25
16 27
17 29
18 35
19 39
20 44
21 57
22 53
23 66
24 75
25 84
26 84
27 114
28 112
29 131
30 133
31 162
32 167
33 209
34 192
35 242
36 250
37 289
38 279
39 363
40 348
41 417
42 404
43 502
44 487
45 608
46 557
47 706
48 682
49 835
50 773
51 1004
52 922
53 1149
54 1059
55 1344
56 1257
57 1595

List of values

[1, 1, 2, 3, 4, 4, 6, 6, 9, 10, 12, 12, 17, 16, 20, 25, 27, 29, 35, 39, 44, 57, 53, 66, 75, 84, 84, 114, 112, 131, 133, 162, 167, 209, 192, 242, 250, 289, 279, 363, 348, 417, 404, 502, 487, 608, 557, 706, 682, 835, 773, 1004, 922, 1149, 1059, 1344, 1257, 1595]