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.

A316401 Number of strict integer partitions of n that are not knapsack (not every subset has a different sum) but 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 1
9 0
10 2
11 0
12 1
13 0
14 3
15 1
16 3
17 2
18 4
19 2
20 6
21 6
22 11
23 9
24 9
25 10
26 20
27 16
28 18
29 17
30 27
31 24
32 31
33 29
34 43
35 31
36 43
37 40
38 59
39 52
40 58
41 61
42 83
43 68
44 93
45 80
46 124
47 99
48 120
49 109
50 145
51 151
52 185
53 160
54 232
55 163
56 257
57 229
58 314
59 280
60 286
61 310
62 427
63 385
64 513
65 333
66 596

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 3, 1, 3, 2, 4, 2, 6, 6, 11, 9, 9, 10, 20, 16, 18, 17, 27, 24, 31, 29, 43, 31, 43, 40, 59, 52, 58, 61, 83, 68, 93, 80, 124, 99, 120, 109, 145, 151, 185, 160, 232, 163, 257, 229, 314, 280, 286, 310, 427, 385, 513, 333, 596]