The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301750 Number of rooted twice-partitions of n where the composite rooted partition is strict. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
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.
LINKS
EXAMPLE
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)()()()()(),
()()()()()()().
MATHEMATICA
twirtns[n_]:=Join@@Table[Tuples[IntegerPartitions[#-1]&/@ptn], {ptn, IntegerPartitions[n-1]}];
Table[Select[twirtns[n], UnsameQ@@Join@@#&]//Length, {n, 30}]
CROSSREFS
Sequence in context: A130732 A018135 A065435 * A086676 A055804 A267372
KEYWORD
nonn
AUTHOR
Gus Wiseman, Mar 26 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 15:24 EDT 2024. Contains 372826 sequences. (Running on oeis4.)