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!)
A316624 Number of balanced p-trees with n leaves. 12
1, 1, 1, 2, 2, 4, 4, 8, 9, 16, 20, 40, 47, 83, 111, 201, 259, 454, 603, 1049, 1432, 2407, 3390, 6006, 8222, 13904, 20304, 34828, 50291, 85817, 126013, 217653, 317894, 535103, 798184, 1367585, 2008125, 3360067, 5048274, 8499942, 12623978, 21023718, 31552560, 52575257 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
A p-tree of weight n is either a single node (if n = 1) or a finite sequence of p-trees whose weights are weakly decreasing and sum to n.
A tree is balanced if all leaves have the same height.
LINKS
EXAMPLE
The a(1) = 1 through a(7) = 4 balanced p-trees:
o (oo) (ooo) (oooo) (ooooo) (oooooo) (ooooooo)
((oo)(oo)) ((ooo)(oo)) ((ooo)(ooo)) ((oooo)(ooo))
((oooo)(oo)) ((ooooo)(oo))
((oo)(oo)(oo)) ((ooo)(oo)(oo))
MATHEMATICA
ptrs[n_]:=If[n==1, {"o"}, Join@@Table[Tuples[ptrs/@p], {p, Rest[IntegerPartitions[n]]}]];
Table[Length[ptrs[n]], {n, 12}]
Table[Length[Select[ptrs[n], SameQ@@Length/@Position[#, "o"]&]], {n, 12}]
PROG
(PARI) seq(n)={my(p=x + O(x*x^n), q=0); while(p, q+=p; p = 1/prod(k=1, n, 1 - polcoef(p, k)*x^k + O(x*x^n)) - 1 - p); Vec(q)} \\ Andrew Howroyd, Oct 26 2018
CROSSREFS
Sequence in context: A306692 A356236 A120803 * A318770 A284613 A000011
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 07 2018
EXTENSIONS
Terms a(17) and beyond from Andrew Howroyd, Oct 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 March 28 10:31 EDT 2024. Contains 371240 sequences. (Running on oeis4.)