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.

A301750 Number of rooted twice-partitions of n where the composite rooted partition is strict.

Original entry on oeis.org

1, 1, 2, 3, 5, 8, 12, 18, 29, 42, 61, 86, 127, 181, 257, 352, 489, 668, 935, 1270, 1730, 2312, 3101, 4112, 5533, 7345, 9742, 12785, 16793, 21821, 28452, 36908, 48108, 62198, 80337, 103081, 132372, 168805, 215247, 273678
Offset: 1

Views

Author

Gus Wiseman, Mar 26 2018

Keywords

Comments

A rooted partition of n is an integer partition of n - 1. A rooted twice-partition of n is a choice of a rooted partition of each part in a rooted partition of n.

Examples

			The a(8) = 18 rooted twice-partitions where the composite rooted partition is strict:
(6), (51), (42), (321),
(5)(), (41)(), (32)(), (4)(1), (3)(2),
(4)()(), (31)()(), (3)(1)(),
(3)()()(), (21)()()(), (2)(1)()(),
(2)()()()(),
(1)()()()()(),
()()()()()()().
		

Crossrefs

Programs

  • Mathematica
    twirtns[n_]:=Join@@Table[Tuples[IntegerPartitions[#-1]&/@ptn],{ptn,IntegerPartitions[n-1]}];
    Table[Select[twirtns[n],UnsameQ@@Join@@#&]//Length,{n,30}]