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.

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

Table of values

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

List of values

[1, 1, 2, 3, 2, 4, 5, 8, 10, 12, 16, 17, 25]

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

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