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.

A330456 Number of multisets of nonempty sets of nonempty sets of positive integers with total sum n.

Original entry on oeis.org

1, 1, 2, 5, 10, 20, 43, 84, 168, 332, 650, 1255, 2428, 4636, 8827, 16702, 31457, 58919, 109977, 204286, 378135, 697240, 1281315, 2346612, 4284654, 7799248, 14157079, 25626996, 46269838, 83330373, 149717844, 268371413, 479996794, 856661792, 1525761119, 2712050472
Offset: 0

Views

Author

Gus Wiseman, Dec 17 2019

Keywords

Examples

			The a(4) = 10 partitions:
  ((4))  ((13))      ((1)(12))        ((2))((2))  ((1))((1))((1))((1))
         ((1)(3))    ((1))((12))
         ((1))((3))  ((1))((1)(2))
                     ((1))((1))((2))
		

Crossrefs

Programs

  • Mathematica
    ppl[n_,k_]:=Switch[k,0,{n},1,IntegerPartitions[n],_,Join@@Table[Union[Sort/@Tuples[ppl[#,k-1]&/@ptn]],{ptn,IntegerPartitions[n]}]];
    Table[Length[Select[ppl[n,3],And[And@@UnsameQ@@@#,And@@UnsameQ@@@Join@@#]&]],{n,0,10}]

Formula

Euler transform of A050342. The Euler transform of a sequence (s_1, s_2, ...) is the sequence with generating function Product_{i > 0} 1/(1 - x^i)^s_i.