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.

A267597 Number of sum-product knapsack partitions of n. Number of integer partitions y of n such that every sum of products of the parts of a multiset partition of any submultiset of y is distinct.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 3
7 3
8 4
9 4
10 6
11 7
12 8
13 12
14 12
15 14
16 18
17 23
18 23
19 32
20 30
21 35
22 50
23 48
24 47
25 56
26 80
27 77
28 87
29 105
30 100
31 134
32 139
33 145
34 194
35 170
36 192
37 250

List of values

[1, 1, 1, 1, 1, 2, 3, 3, 4, 4, 6, 7, 8, 12, 12, 14, 18, 23, 23, 32, 30, 35, 50, 48, 47, 56, 80, 77, 87, 105, 100, 134, 139, 145, 194, 170, 192, 250]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.