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.

A320053 Number of spanning 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 y is distinct.

Table of values

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

List of values

[1, 1, 2, 3, 2, 3, 4, 5, 6, 8, 9, 12, 14]