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.

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

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 2
6 3
7 3
8 4
9 4
10 6
11 8
12 8

List of values

[1, 0, 1, 1, 1, 2, 3, 3, 4, 4, 6, 8, 8]