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.

A304796 Number of special sums of integer partitions of n.

Original entry on oeis.org

1, 2, 5, 10, 18, 32, 51, 82, 122, 188, 262, 392, 529, 750, 997, 1404, 1784, 2452, 3123, 4164, 5239, 6916, 8499, 11112, 13693, 17482, 21257, 27162, 32581, 41114, 49606, 61418, 73474, 91086, 107780, 132874, 157359, 191026, 225159, 274110, 320691, 386722, 453875
Offset: 0

Views

Author

Gus Wiseman, May 18 2018

Keywords

Comments

A special sum of an integer partition y is a number n >= 0 such that exactly one submultiset of y sums to n.

Examples

			The a(4) = 18 special positive subset-sums:
0<=(4), 4<=(4),
0<=(22), 2<=(22), 4<=(22),
0<=(31), 1<=(31), 3<=(31), 4<=(31),
0<=(211), 1<=(211), 3<=(211), 4<=(211),
0<=(1111), 1<=(1111), 2<=(1111), 3<=(1111), 4<=(1111).
		

Crossrefs

Programs

  • Mathematica
    uqsubs[y_]:=Join@@Select[GatherBy[Union[Subsets[y]],Total],Length[#]===1&];
    Table[Total[Length/@uqsubs/@IntegerPartitions[n]],{n,25}]

Formula

a(n) = A301854(n) + A000041(n).

Extensions

More terms from Alois P. Heinz, May 18 2018
a(36)-a(42) from Chai Wah Wu, Sep 26 2023