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.

A325863 Number of integer partitions of n such that every distinct non-singleton submultiset has a different sum.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 6
6 9
7 11
8 15
9 17
10 24
11 29
12 31
13 41
14 51
15 58
16 67
17 84
18 91
19 117
20 117

List of values

[1, 1, 2, 3, 5, 6, 9, 11, 15, 17, 24, 29, 31, 41, 51, 58, 67, 84, 91, 117, 117]