The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A301345 Regular triangle where T(n,k) is the number of transitive rooted trees with n nodes and k leaves. 11
 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 1, 3, 1, 0, 0, 0, 1, 2, 4, 1, 0, 0, 0, 0, 3, 4, 5, 1, 0, 0, 0, 0, 2, 6, 6, 6, 1, 0, 0, 0, 0, 1, 6, 10, 9, 7, 1, 0, 0, 0, 0, 1, 5, 12, 16, 12, 8, 1, 0, 0, 0, 0, 0, 4, 13, 22, 23, 16, 9, 1, 0, 0, 0, 0, 0, 3, 14, 27, 36, 32, 20, 10, 1, 0, 0, 0, 0, 0, 2, 11 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,13 LINKS EXAMPLE Triangle begins: 1 1   0 0   1   0 0   1   1   0 0   0   2   1   0 0   0   1   3   1   0 0   0   1   2   4   1   0 0   0   0   3   4   5   1   0 0   0   0   2   6   6   6   1   0 0   0   0   1   6  10   9   7   1   0 0   0   0   1   5  12  16  12   8   1   0 The T(9,5) = 6 transitive rooted trees: (o(o)(oo(o))), (o((oo))(oo)), (oo(o)(o(o))), (o(o)(o)(oo)), (ooo(o)((o))), (oo(o)(o)(o)). MATHEMATICA rut[n_]:=rut[n]=If[n===1, {{}}, Join@@Function[c, Union[Sort/@Tuples[rut/@c]]]/@IntegerPartitions[n-1]]; trat[n_]:=Select[rut[n], Complement[Union@@#, #]==={}&]; Table[Length[Select[trat[n], Count[#, {}, {-2}]===k&]], {n, 15}, {k, n}] CROSSREFS Row sums are A290689. Cf. A000081, A001190, A003238, A004111, A032305, A055277, A276625, A279861, A290760, A290822, A298422, A298426, A301342, A301343, A301344. Sequence in context: A057094 A284938 A186084 * A047998 A017847 A127841 Adjacent sequences:  A301342 A301343 A301344 * A301346 A301347 A301348 KEYWORD nonn,tabl AUTHOR Gus Wiseman, Mar 19 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 16 21:28 EDT 2021. Contains 343951 sequences. (Running on oeis4.)