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.

A316400 Number of strict integer partitions of n that are knapsack (every subset has a different sum) but not every subset has a different average.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 2
10 0
11 0
12 2
13 0
14 0
15 4
16 1
17 2
18 4
19 6
20 4
21 13
22 6
23 13
24 17
25 15
26 12
27 31
28 26
29 27
30 23
31 36
32 41
33 56
34 39
35 47
36 74
37 71
38 55
39 101
40 94
41 110
42 97
43 145
44 148
45 189
46 142
47 214
48 232
49 280
50 206
51 362
52 332
53 414
54 347
55 504
56 469
57 658
58 492
59 726
60 697
61 867
62 687
63 1100
64 933

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 4, 1, 2, 4, 6, 4, 13, 6, 13, 17, 15, 12, 31, 26, 27, 23, 36, 41, 56, 39, 47, 74, 71, 55, 101, 94, 110, 97, 145, 148, 189, 142, 214, 232, 280, 206, 362, 332, 414, 347, 504, 469, 658, 492, 726, 697, 867, 687, 1100, 933]