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.

A316402 Number of strict non-knapsack integer partitions of n, meaning not every subset has a different sum.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 1
9 0
10 3
11 1
12 4
13 3
14 8
15 6
16 12
17 10
18 20
19 16
20 29
21 25
22 44
23 39
24 61
25 60
26 91
27 84
28 125
29 126
30 180
31 179
32 242
33 247
34 336
35 347
36 444
37 472
38 606
39 628
40 796
41 844
42 1053
43 1109
44 1363
45 1452
46 1779
47 1885
48 2272
49 2431
50 2931
51 3104
52 3706
53 3972
54 4711
55 5042
56 5909
57 6334

List of values

[0, 0, 0, 0, 0, 1, 0, 1, 0, 3, 1, 4, 3, 8, 6, 12, 10, 20, 16, 29, 25, 44, 39, 61, 60, 91, 84, 125, 126, 180, 179, 242, 247, 336, 347, 444, 472, 606, 628, 796, 844, 1053, 1109, 1363, 1452, 1779, 1885, 2272, 2431, 2931, 3104, 3706, 3972, 4711, 5042, 5909, 6334]