A080936 -id:A080936 - cp's OEIS frontend

A109082 Depth of rooted tree having Matula-Goebel number n.

0, 1, 2, 1, 3, 2, 2, 1, 2, 3, 4, 2, 3, 2, 3, 1, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 2, 4, 3, 5, 1, 4, 3, 3, 2, 3, 2, 3, 3, 4, 2, 3, 4, 3, 3, 4, 2, 2, 3, 3, 3, 2, 2, 4, 2, 2, 4, 4, 3, 3, 5, 2, 1, 3, 4, 3, 3, 3, 3, 4, 2, 3, 3, 3, 2, 4, 3, 5, 3, 2, 4, 4, 2, 3, 3, 4, 4, 3, 3, 3, 3, 5, 4, 3, 2, 4, 2, 4, 3

Offset: 1

Keith Briggs, Aug 17 2005

nonn

Another term for depth is height.

Starting with n, a(n) is the number of times one must take the product of prime indices (A003963) to reach 1. - Gus Wiseman, Mar 27 2019

			a(7) = 2 because the rooted tree with Matula-Goebel number 7 is the 3-edge rooted tree Y of height 2.

François Marques, Table of n, a(n) for n = 1..10000 (terms 1..5381 from Alois P. Heinz).
Emeric Deutsch, Tree statistics from Matula numbers, arXiv preprint arXiv:1111.4288 [math.CO], 2011.
F. Goebel, On a 1-1-correspondence between rooted trees and natural numbers, J. Combin. Theory, B 29 (1980), 141-143.
I. Gutman and A. Ivic, On Matula numbers, Discrete Math., 150, 1996, 131-142.
I. Gutman and Yeong-Nan Yeh, Deducing properties of trees from their Matula numbers, Publ. Inst. Math., 53 (67), 1993, 17-22.
D. W. Matula, A natural rooted tree enumeration by prime factorization, SIAM Rev. 10 (1968) 273.
Index entries for sequences related to Matula-Goebel numbers

A left inverse of A007097.
Cf. A003963, A061775, A091233.
Cf. A000081, A000720, A001222, A109129, A112798, A196050, A290822, A317713, A320325, A324927 (positions of 2), A324928 (positions of 3), A325032.
This statistic is counted by A034781, ordered A080936.
The ordered version is A358379.
For node-height instead of edge-height we have A358552.
Cf. A000108, A055277, A056239, A342507, A358576.

with(numtheory): a := proc(n) option remember; if n = 1 then 0 elif isprime(n) then 1+a(pi(n)) else max((map (p->a(p), factorset(n)))[]) end if end proc: seq(a(n), n = 1 .. 100); # Emeric Deutsch, Sep 16 2011

a [n_] := a[n] = If[n == 1, 0, If[PrimeQ[n], 1+a[PrimePi[n]], Max[Map[a, FactorInteger[n][[All, 1]]]]]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, May 06 2014, after Emeric Deutsch *)

a(n) = my(v=factor(n)[,1],d=0); while(#v,d++; v=fold(setunion, apply(p->factor(primepi(p))[,1]~, v))); d; \\ Kevin Ryde, Sep 21 2020

from functools import lru_cache
from sympy import isprime, primepi, primefactors
@lru_cache(maxsize=None)
def A109082(n):
    if n == 1 : return 0
    if isprime(n): return 1+A109082(primepi(n))
    return max(A109082(p) for p in primefactors(n)) # Chai Wah Wu, Mar 19 2022

a(1)=0; if n is the t-th prime, then a(n) = 1 + a(t); if n is composite, n=t*s, then a(n) = max(a(t),a(s)). The Maple program is based on this.
a(A007097(n)) = n.
a(n) = A358552(n) - 1. - Gus Wiseman, Nov 27 2022

Edited by Emeric Deutsch, Sep 16 2011

A000891 a(n) = (2n)!(2n+1)! / (n! (n+1)!)^2.

Original entry on oeis.org

1, 3, 20, 175, 1764, 19404, 226512, 2760615, 34763300, 449141836, 5924217936, 79483257308, 1081724803600, 14901311070000, 207426250094400, 2913690606794775, 41255439318353700, 588272005095043500

Offset: 0

N. J. A. Sloane

nonn

Number of parallelogram polyominoes having n+1 columns and n+1 rows. - Emeric Deutsch, May 21 2003
Number of tilings of an  hexagon.
a(n) is the number of non-crossing partitions of [2n+1] into n+1 blocks. For example, a[1] counts 13-2, 1-23, 12-3. - David Callan, Jul 25 2005
The number of returning walks of length 2n on the upper half of a square lattice, since a(n) = Sum_{k=0..2n} binomial(2n,k)*A126120(k)*A126869(n-k). - Andrew V. Sutherland, Mar 24 2008
For sequences counting walks in the upper half-plane starting from the origin and finishing at the lattice points (0,m) see A145600 (m = 1), A145601 (m = 2), A145602 (m = 3) and A145603 (m = 4). - Peter Bala, Oct 14 2008
The number of proper mergings of two n-chains. - Henri Mühle, Aug 17 2012
a(n) is number of pairs of non-intersecting lattice paths from (0,0) to (n+1,n+1) using (1,0) and (0,1) as steps. Here, non-intersecting means two paths do not share a vertex except the origin and the destination. For example, a(1) = 3 because we have three such pairs from (0,0) to (2,2): {NNEE,EENN}, {NNEE,ENEN}, {NENE,EENN}. - Ran Pan, Oct 01 2015
Also the number of ordered rooted trees with 2(n+1) nodes and n+1 leaves, i.e., half of the nodes are leaves. These trees are ranked by A358579. The unordered version is A185650. - Gus Wiseman, Nov 27 2022
The number of secondary GL(2) invariants constructed from n+1 two component vectors. This number was evaluated by using the Molien-Weyl formula to compute the Hilbert series of the ring of invariants. - Jaco van Zyl, Jun 30 2025

			G.f. = 1 + 3*x + 20*x^2 + 175*x^3 + 1764*x^4 + 19404*x^5 + ...
From _Gus Wiseman_, Nov 27 2022: (Start)
The a(2) = 20 ordered rooted trees with 6 nodes and 3 leaves:
  (((o)oo))  (((o)o)o)  (((o))oo)
  (((oo)o))  (((oo))o)  ((o)(o)o)
  (((ooo)))  ((o)(oo))  ((o)o(o))
  ((o(o)o))  ((o(o))o)  (o((o))o)
  ((o(oo)))  ((oo)(o))  (o(o)(o))
  ((oo(o)))  (o((o)o))  (oo((o)))
             (o((oo)))
             (o(o(o)))
(End)

J. M. Borwein and P. B. Borwein, Pi and the AGM, Wiley, 1987, p. 8.
E. R. Hansen, A Table of Series and Products, Prentice-Hall, Englewood Cliffs, NJ, 1975, p. 94.

Vincenzo Librandi, Table of n, a(n) for n = 0..100
Abderrahim Arabi, Hacène Belbachir, and Jean-Philippe Dubernard, Enumeration of parallelogram polycubes, arXiv:2105.00971 [cs.DM], 2021.
Elena Barcucci, Andrea Frosini and Simone Rinaldi, On directed-convex polyominoes in a rectangle, Discr. Math., 298 (2005). 62-78.
Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, J. Integer Sequ., Vol. 9 (2006), Article 06.2.4.
Paul Barry, On a Generalization of the Narayana Triangle, J. Int. Seq. 14 (2011), Article 11.4.5.
William Y. C. Chen, Sabrina X. M. Pang, Ellen X. Y. Qu, and Richard P. Stanley, Pairs of Noncrossing Free Dyck Paths and Noncrossing Partitions, arXiv:0804.2930 [math.CO], 2008.
William Y. C. Chen, Sabrina X. M. Pang, Ellen X. Y. Qu, and Richard P. Stanley, Pairs of Noncrossing Free Dyck Paths and Noncrossing Partitions, Discrete Math., 309 (2009), 2834-2838.
Robert de Mello Koch, Animik Ghosh, and Hendrik J. R. Van Zyl, Bosonic Fortuity in Vector Models, arXiv:2504.14181 [hep-th], 2025. See p. 9; Journal of High Energy Physics 06 (2025) 246.
Ivan Marin and Emmanuel Wagner, A cubic defining algebra for the Links-Gould polynomial. arXiv preprint arXiv:1203.5981 [math.GT], 2012. - From _N. J. A. Sloane_, Sep 21 2012
Henri Mühle, Counting Proper Mergings of Chains and Antichains, arXiv:1206.3922 [math.CO], 2012.
Guoce Xin, Determinant formulas relating to tableaux of bounded height, Adv. Appl. Math. 45 (2010) 197-211.

Cf. A000356, A010370, A038535.
Cf. A145600, A145601, A145602, A145603. - Peter Bala, Oct 14 2008
Cf. A000142, A000894, A248045.
Equals half of A267981.
Counts the trees ranked by A358579.
A001263 counts ordered rooted trees by nodes and leaves.
A090181 counts ordered rooted trees by nodes and internals.
Cf. A000108, A065097, A080936, A185650, A358371, A358586, A358590.

a000891 n = a001263 (2 * n - 1) n  -- Reinhard Zumkeller, Oct 10 2013

[Factorial(2*n)*Factorial(2*n+1) / (Factorial(n) * Factorial(n+1))^2: n in [0..20]]; // Vincenzo Librandi, Aug 15 2011

with(combstruct): bin := {B=Union(Z,Prod(B,B))} :seq(1/2*binomial(2*i,i)*(count([B,bin,unlabeled],size=i)), i=1..18) ; # Zerinvary Lajos, Jun 06 2007

a[ n_] := If[ n == -1, 0, Binomial[2 n + 1, n]^2 / (2 n + 1)]; (* Michael Somos, May 28 2014 *)
a[ n_] := SeriesCoefficient[ (1 - Hypergeometric2F1[ -1/2, 1/2, 1, 16 x]) / (4 x), {x, 0, n}]; (* Michael Somos, May 28 2014 *)
a[ n_] := If[ n < 0, 0, (2 n)! SeriesCoefficient[ BesselI[0, 2 x] BesselI[1, 2 x] / x, {x, 0, 2 n}]]; (* Michael Somos, May 28 2014 *)
a[ n_] := SeriesCoefficient[ (1 - EllipticE[ 16 x] / (Pi/2)) / (4 x), {x, 0, n}]; (* Michael Somos, Sep 18 2016 *)
a[n_] := (2 n + 1) CatalanNumber[n]^2;
Array[a, 20, 0] (* Peter Luschny, Mar 03 2020 *)

{a(n) = binomial(2*n+1, n)^2 / (2*n + 1)}; /* Michael Somos, Jun 22 2005 */

a(n) = matdet(matrix(n, n, i, j, binomial(n+j+1,i+1))) \\ Hugo Pfoertner, Oct 22 2022

-4*a(n) = A010370(n+1).
G.f.: (1 - E(16*x)/(Pi/2))/(4*x) where E() is the elliptic integral of the second kind. [edited by Olivier Gérard, Feb 16 2011]
G.f.: 3F2(1, 1/2, 3/2; 2,2; 16*x)= (1 - 2F1(-1/2, 1/2; 1; 16*x)) / (4*x). - Olivier Gérard, Feb 16 2011
E.g.f.: Sum_{n>=0} a(n)*x^(2*n)/(2*n)! = BesselI(0, 2*x) * BesselI(1, 2*x) / x. - Michael Somos, Jun 22 2005
a(n) = A001700(n)*A000108(n) = (1/2)*A000984(n+1)*A000108(n). - Zerinvary Lajos, Jun 06 2007
For n > 0, a(n) = (n+2)*A000356(n) starting (1, 5, 35, 294, ...). - Gary W. Adamson, Apr 08 2011
a(n) = A001263(2*n+1,n+1) = binomial(2*n+1,n+1)*binomial(2*n+1,n)/(2*n+1) (central members of odd numbered rows of Narayana triangle).
G.f.: If G_N(x) = 1 + Sum_{k=1..N} ((2*k)!*(2*k+1)!*x^k)/(k!*(k+1)!)^2, G_N(x) = 1 + 12*x/(G(0) - 12*x); G(k) = 16*x*k^2 + 32*x*k + k^2 + 4*k + 12*x + 4 - 4*x*(2*k+3)*(2*k+5)*(k+2)^2/G(k+1); (continued fraction). - Sergei N. Gladkovskii, Nov 24 2011
D-finite with recurrence (n+1)^2*a(n) - 4*(2*n-1)*(2*n+1)*a(n-1) = 0. - R. J. Mathar, Dec 03 2012
a(n) = A005558(2n). - Mark van Hoeij, Aug 20 2014
a(n) = A000894(n) / (n+1) = A248045(n+1) / A000142(n+1). - Reinhard Zumkeller, Sep 30 2014
From Ilya Gutkovskiy, Feb 01 2017: (Start)
E.g.f.: 2F2(1/2,3/2; 2,2; 16*x).
a(n) ~ 2^(4*n+1)/(Pi*n^2). (End)
a(n) = A005408(n)*(A000108(n))^2. - Ivan N. Ianakiev, Nov 13 2019
a(n) = det(M(n)) where M(n) is the n X n matrix with m(i,j) = binomial(n+j+1,i+1). - Benoit Cloitre, Oct 22 2022
a(n) = Integral_{x=0..16} x^n*W(x) dx, where W(x) = (16*EllipticE(1 - x/16) - x*EllipticK(1 - x/16))/(8*Pi^2*sqrt(x)), n=>0. W(x) diverges at x=0, monotonically decreases for x>0, and vanishes at x=16. EllipticE and EllipticK are elliptic functions. This integral representation as n-th moment of a positive function W(x) on the interval [0, 16] is unique. - Karol A. Penson, Dec 20 2023

More terms from Andrew V. Sutherland, Mar 24 2008

A358552 Node-height of the rooted tree with Matula-Goebel number n. Number of nodes in the longest path from root to leaf.

Original entry on oeis.org

1, 2, 3, 2, 4, 3, 3, 2, 3, 4, 5, 3, 4, 3, 4, 2, 4, 3, 3, 4, 3, 5, 4, 3, 4, 4, 3, 3, 5, 4, 6, 2, 5, 4, 4, 3, 4, 3, 4, 4, 5, 3, 4, 5, 4, 4, 5, 3, 3, 4, 4, 4, 3, 3, 5, 3, 3, 5, 5, 4, 4, 6, 3, 2, 4, 5, 4, 4, 4, 4, 5, 3, 4, 4, 4, 3, 5, 4, 6, 4, 3, 5, 5, 3, 4, 4, 5, 5, 4, 4, 4, 4, 6, 5, 4, 3, 5, 3, 5, 4, 5, 4, 4, 4, 4, 3, 4, 3

Offset: 1

Gus Wiseman, Nov 26 2022

nonn

Edge-height is given by A109082 (see formula).

The Matula-Goebel number of a rooted tree is the product of primes indexed by the Matula-Goebel numbers of the branches of its root, which gives a bijective correspondence between positive integers and unlabeled rooted trees.

			The Matula-Goebel number of ((ooo(o))) is 89, and it has node-height 4, so a(89) = 4.

Antti Karttunen, Table of n, a(n) for n = 1..100000

Positions of first appearances are A007097.
This statistic is counted by A034781, ordered A080936.
The ordered version is A358379(n) + 1.
A000081 counts rooted trees, ordered A000108.
A055277 counts rooted trees by nodes and leaves, ordered A001263.
Other statistics: A061775 (nodes), A109082 (edge-height), A109129 (leaves), A196050 (edges), A342507 (internals).
Cf. A000040, A000720, A001222, A056239, A112798.
Cf. A206487, A358576, A358589, A358592, A358729.

MGTree[n_]:=If[n==1,{},MGTree/@If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Table[Depth[MGTree[n]]-1,{n,100}]

A358552(n) = { my(v=factor(n)[, 1], d=0); while(#v, d++; v=fold(setunion, apply(p->factor(primepi(p))[, 1]~, v))); (1+d); }; \\ (after Kevin Ryde in A109082) - Antti Karttunen, Oct 23 2023

from functools import lru_cache
from sympy import isprime, primepi, primefactors
@lru_cache(maxsize=None)
def A358552(n):
    if n == 1 : return 1
    if isprime(n): return 1+A358552(primepi(n))
    return max(A358552(p) for p in primefactors(n)) # Chai Wah Wu, Apr 15 2024

a(n) = A109082(n) + 1.

a(n) = A061775(n) - A358729(n). - Antti Karttunen, Oct 23 2023

Data section extended up to a(108) by Antti Karttunen, Oct 23 2023

A358589 Number of square rooted trees with n nodes.

Original entry on oeis.org

1, 0, 1, 0, 3, 2, 11, 17, 55, 107, 317, 720, 1938, 4803, 12707, 32311, 85168, 220879, 581112, 1522095, 4014186, 10568936, 27934075, 73826753, 195497427, 517927859, 1373858931, 3646158317, 9684878325, 25737819213, 68439951884, 182070121870, 484583900955, 1290213371950

Offset: 1

Gus Wiseman, Nov 23 2022

nonn

We say that a tree is square if it has the same height as number of leaves.

			The a(1) = 1 through a(7) = 11 trees:
  o  .  (oo)  .  ((ooo))  ((o)(oo))  (((oooo)))
                 (o(oo))  (o(o)(o))  ((o(ooo)))
                 (oo(o))             ((oo(oo)))
                                     ((ooo(o)))
                                     (o((ooo)))
                                     (o(o(oo)))
                                     (o(oo(o)))
                                     (oo((oo)))
                                     (oo(o(o)))
                                     (ooo((o)))
                                     ((o)(o)(o))

Andrew Howroyd, Table of n, a(n) for n = 1..200

For internals instead of height we have A185650 aerated, ranked by A358578.
These trees are ranked by A358577.
For internals instead of leaves we have A358587, ranked by A358576.
The ordered version is A358590.
A000081 counts rooted trees, ordered A000108.
A034781 counts rooted trees by nodes and height, ordered A080936.
A055277 counts rooted trees by nodes and leaves, ordered A001263.
A358575 counts rooted trees by nodes and internal nodes, ordered A090181.
Cf. A000891, A065097, A109129, A358552, A358588, A358591.

art[n_]:=If[n==1,{{}},Join@@Table[Select[Tuples[art/@c],OrderedQ],{c,Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[Select[art[n],Count[#,{},{0,Infinity}]==Depth[#]-1&]],{n,1,10}]

\\ R(n,f) enumerates trees by height(h), nodes(x) and leaves(y).
R(n,f) = {my(A=O(x*x^n), Z=0); for(h=1, n, my(p = A); A = x*(y - 1  + exp( sum(i=1, n-1, 1/i * subst( subst( A + O(x*x^((n-1)\i)), x, x^i), y, y^i) ) )); Z += f(h, A-p)); Z}
seq(n) = {Vec(R(n, (h,p)->polcoef(p,h,y)), -n)} \\ Andrew Howroyd, Jan 01 2023

Terms a(19) and beyond from Andrew Howroyd, Jan 01 2023

A358590 Number of square ordered rooted trees with n nodes.

Original entry on oeis.org

1, 0, 1, 0, 6, 5, 36, 84, 309, 890, 3163, 9835, 32979, 108252, 360696, 1192410, 3984552, 13276769, 44371368, 148402665, 497072593, 1665557619, 5586863093, 18750662066, 62968243731, 211565969511, 711187790166, 2391640404772, 8045964959333, 27077856222546

Offset: 1

Gus Wiseman, Nov 25 2022

nonn

We say that a tree is square if it has the same height as number of leaves.

			The a(1) = 1 through a(6) = 5 ordered trees:
  o  .  (oo)  .  ((o)oo)  ((o)(o)o)
                 ((oo)o)  ((o)(oo))
                 ((ooo))  ((o)o(o))
                 (o(o)o)  ((oo)(o))
                 (o(oo))  (o(o)(o))
                 (oo(o))

Andrew Howroyd, Table of n, a(n) for n = 1..200

For internals instead of height we have A000891, unordered A185650 aerated.
For internals instead of leaves we have A358588, unordered A358587.
The unordered version is A358589, ranked by A358577.
A000108 counts ordered rooted trees, unordered A000081.
A001263 counts ordered rooted trees by nodes and leaves, unordered A055277.
A080936 counts ordered rooted trees by nodes and height, unordered A034781.
A090181 counts ordered rooted trees by nodes and internals, unord. A358575.
Cf. A065097, A109129, A358371, A358552, A358579, A358586.

aot[n_]:=If[n==1,{{}},Join@@Table[Tuples[aot/@c],{c,Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[Select[aot[n],Count[#,{},{0,Infinity}]==Depth[#]-1&]],{n,1,10}]

\\ R(n,f) enumerates trees by height(h), nodes(x) and leaves(y).
R(n,f) = {my(A=O(x*x^n), Z=0); for(h=1, n, my(p = A); A = x*(y - 1  + 1/(1 - A + O(x^n))); Z += f(h, A-p)); Z}
seq(n) = {Vec(R(n, (h,p)->polcoef(p,h,y)), -n)} \\ Andrew Howroyd, Jan 01 2023

Terms a(16) and beyond from Andrew Howroyd, Jan 01 2023

A358586 Number of ordered rooted trees with n nodes, at least half of which are leaves.

Original entry on oeis.org

1, 1, 1, 4, 7, 31, 66, 302, 715, 3313, 8398, 39095, 104006, 484706, 1337220, 6227730, 17678835, 82204045, 238819350, 1108202513, 3282060210, 15195242478, 45741281820, 211271435479, 644952073662, 2971835602526, 9183676536076, 42217430993002, 131873975875180, 604834233372884

Offset: 1

Gus Wiseman, Nov 24 2022

nonn

			The a(1) = 1 through a(5) = 7 ordered trees:
  o  (o)  (oo)  (ooo)   (oooo)
                ((o)o)  ((o)oo)
                ((oo))  ((oo)o)
                (o(o))  ((ooo))
                        (o(o)o)
                        (o(oo))
                        (oo(o))

Andrew Howroyd, Table of n, a(n) for n = 1..1000

For equality we have A000891, unordered A185650.
Odd-indexed terms appear to be A065097.
The unordered version is A358583.
The opposite is the same, unordered A358584.
The strict case is A358585, unordered A358581.
A000108 counts ordered rooted trees, unordered A000081.
A001263 counts ordered rooted trees by nodes and leaves, unordered A055277.
A080936 counts ordered rooted trees by nodes and height, unordered A034781.
A090181 counts ordered rooted trees by nodes and internals, unord. A358575.
A358590 counts square ordered trees, unordered A358589 (ranked by A358577).
Cf. A109129, A342507, A358371, A358579, A358580, A358582, A358584, A358588.

aot[n_]:=If[n==1,{{}},Join@@Table[Tuples[aot/@c],{c,Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[Select[aot[n],Count[#,{},{0,Infinity}]>=Count[#,[_],{0,Infinity}]&]],{n,1,10}]

a(n) = if(n==1, 1, n--; (binomial(2*n,n)/(n+1) + if(n%2, binomial(n, (n-1)/2)^2 / n))/2) \\ Andrew Howroyd, Jan 13 2024

From Andrew Howroyd, Jan 13 2024: (Start)
a(n) = Sum_{k=1..floor(n/2)} A001263(n-1, k) for n >= 2.
a(2*n) = (A000108(2*n-1) + A000891(n-1))/2 for n >= 1;
a(2*n+1) = A000108(2*n)/2 for n >= 1. (End)

a(16) onwards from Andrew Howroyd, Jan 13 2024

A358587 Number of n-node rooted trees of height equal to the number of internal (non-leaf) nodes.

Original entry on oeis.org

0, 0, 0, 0, 1, 4, 14, 41, 111, 282, 688, 1627, 3761, 8540, 19122, 42333, 92851, 202078, 436916, 939359, 2009781, 4281696, 9087670, 19223905, 40544951, 85284194, 178956984, 374691171, 782936761, 1632982372, 3400182458, 7068800357, 14674471611, 30422685030

Offset: 1

Gus Wiseman, Nov 23 2022

nonn

			The a(5) = 1 through a(7) = 14 trees:
  ((o)(o))  ((o)(oo))   ((o)(ooo))
            (o(o)(o))   ((oo)(oo))
            (((o)(o)))  (o(o)(oo))
            ((o)((o)))  (oo(o)(o))
                        (((o))(oo))
                        (((o)(oo)))
                        ((o)((oo)))
                        ((o)(o(o)))
                        ((o(o)(o)))
                        (o((o)(o)))
                        (o(o)((o)))
                        ((((o)(o))))
                        (((o)((o))))
                        ((o)(((o))))

Andrew Howroyd, Table of n, a(n) for n = 1..200

For leaves instead of height we have A185650 aerated, ranked by A358578.
These trees are ranked by A358576.
The ordered version is A358588.
Square trees are counted by A358589, ranked by A358577, ordered A358590.
A000081 counts rooted trees, ordered A000108.
A034781 counts rooted trees by nodes and height, ordered A080936.
A055277 counts rooted trees by nodes and leaves, ordered A001263.
A358575 counts rooted trees by nodes and internal nodes, ordered A090181.
Cf. A000891, A065097, A342507, A358552, A358581-A358584, A358591.

art[n_]:=If[n==1,{{}},Join@@Table[Select[Tuples[art/@c],OrderedQ],{c,Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[Select[art[n],Count[#,[_],{0,Infinity}]==Depth[#]-1&]],{n,1,10}]

\\ Needs R(n,f) defined in A358589.
seq(n) = {Vec(R(n, (h,p)->polcoef(subst(p, x, x/y), -h, y)), -n)} \\ Andrew Howroyd, Jan 01 2023

Conjectures from Chai Wah Wu, Apr 15 2024: (Start)
a(n) = 5*a(n-1) - 7*a(n-2) - a(n-3) + 8*a(n-4) - 4*a(n-5) for n > 7.
G.f.: x^5*(x^2 - x + 1)/((x - 1)^2*(x + 1)*(2*x - 1)^2). (End)

Terms a(19) and beyond from Andrew Howroyd, Jan 01 2023

A358581 Number of rooted trees with n nodes, most of which are leaves.

Original entry on oeis.org

1, 0, 1, 1, 4, 5, 20, 28, 110, 169, 663, 1078, 4217, 7169, 27979, 49191, 191440, 345771, 1341974, 2477719, 9589567, 18034670, 69612556, 132984290, 511987473, 991391707, 3807503552, 7460270591, 28585315026, 56595367747, 216381073935, 432396092153

Offset: 1

Gus Wiseman, Nov 23 2022

nonn

			The a(1) = 1 through a(7) = 20 trees:
  o  .  (oo)  (ooo)  (oooo)   (ooooo)   (oooooo)
                     ((ooo))  ((oooo))  ((ooooo))
                     (o(oo))  (o(ooo))  (o(oooo))
                     (oo(o))  (oo(oo))  (oo(ooo))
                              (ooo(o))  (ooo(oo))
                                        (oooo(o))
                                        (((oooo)))
                                        ((o)(ooo))
                                        ((o(ooo)))
                                        ((oo)(oo))
                                        ((oo(oo)))
                                        ((ooo(o)))
                                        (o((ooo)))
                                        (o(o)(oo))
                                        (o(o(oo)))
                                        (o(oo(o)))
                                        (oo((oo)))
                                        (oo(o)(o))
                                        (oo(o(o)))
                                        (ooo((o)))

Andrew Howroyd, Table of n, a(n) for n = 1..200

For equality we have A185650 aerated, ranked by A358578.
The opposite version is A358582, non-strict A358584.
The non-strict version is A358583.
The ordered version is A358585, odd-indexed terms A065097.
A000081 counts rooted trees, ordered A000108.
A034781 counts rooted trees by nodes and height, ordered A080936.
A055277 counts rooted trees by nodes and leaves, ordered A001263.
A358575 counts rooted trees by nodes and internal nodes, ordered A090181.
A358589 counts square trees, ranked by A358577, ordered A358590.
Cf. A000891, A109129, A342507, A358579, A358580, A358586, A358591.

art[n_]:=If[n==1,{{}},Join@@Table[Select[Tuples[art/@c],OrderedQ],{c,Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[Select[art[n],Count[#,{},{0,Infinity}]>Count[#,[_],{0,Infinity}]&]],{n,0,10}]

\\ See A358584 for R(n).
seq(n) = {my(A=R(n)); vector(n, n, my(u=Vecrev(A[n]/y)); vecsum(u[n\2+1..#u]))} \\ Andrew Howroyd, Dec 31 2022

A358581(n) + A358584(n) = A000081(n).
A358582(n) + A358583(n) = A000081(n).
a(n) = Sum_{k=floor(n/2)+1..n} A055277(n, k). - Andrew Howroyd, Dec 31 2022

Terms a(19) and beyond from Andrew Howroyd, Dec 31 2022

A358379 Edge-height (or depth) of the n-th standard ordered rooted tree.

Original entry on oeis.org

0, 1, 2, 1, 3, 2, 2, 1, 2, 3, 2, 2, 3, 2, 2, 1, 4, 2, 3, 3, 3, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 1, 3, 4, 2, 2, 3, 3, 3, 3, 2, 3, 2, 2, 3, 2, 2, 2, 4, 2, 3, 3, 3, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 1, 3, 3, 4, 4, 3, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 2, 3, 3, 3, 2, 2

Offset: 1

Gus Wiseman, Nov 16 2022

nonn

We define the n-th standard ordered rooted tree to be obtained by taking the (n-1)-th composition in standard order (graded reverse-lexicographic, A066099) as root and replacing each part with its own standard ordered rooted tree. This ranking is an ordered variation of Matula-Goebel numbers, giving a bijective correspondence between positive integers and unlabeled ordered rooted trees.

			The standard ordered rooted tree ranking begins:
  1: o        10: (((o))o)   19: (((o))(o))
  2: (o)      11: ((o)(o))   20: (((o))oo)
  3: ((o))    12: ((o)oo)    21: ((o)((o)))
  4: (oo)     13: (o((o)))   22: ((o)(o)o)
  5: (((o)))  14: (o(o)o)    23: ((o)o(o))
  6: ((o)o)   15: (oo(o))    24: ((o)ooo)
  7: (o(o))   16: (oooo)     25: (o(oo))
  8: (ooo)    17: ((((o))))  26: (o((o))o)
  9: ((oo))   18: ((oo)o)    27: (o(o)(o))
For example, the 52nd ordered tree is (o((o))oo) so a(52) = 3.

Gus Wiseman, Statistics, classes, and transformations of standard compositions

Records occur at A004249.
The triangle counting trees by this statistic is A080936, unordered A034781.
Unordered version is A109082, nodes A061775, leaves A109129, edges A196050.
Leaves are counted by A358371.
Nodes are counted by A358372.
Node-height is a(n) + 1, unordered version is A358552.
A000081 counts unordered rooted trees, ranked by A358378.
A000108 counts ordered rooted trees.
A001263 counts ordered rooted trees by leaves.
Cf. A005043, A055277, A187306, A358373, A358374, A358375, A358376, A358377.

stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
srt[n_]:=If[n==1,{},srt/@stc[n-1]];
Table[Depth[srt[n]]-2,{n,100}]

cp's OEIS Frontend

A259899 a(n) is the minimal position at which the maximal value of row n appears in row n of triangle A080936.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A109082 Depth of rooted tree having Matula-Goebel number n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

Extensions

A000891 a(n) = (2*n)!*(2*n+1)! / (n! * (n+1)!)^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Formula

Extensions

A358552 Node-height of the rooted tree with Matula-Goebel number n. Number of nodes in the longest path from root to leaf.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A358589 Number of square rooted trees with n nodes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A358590 Number of square ordered rooted trees with n nodes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A000891 a(n) = (2n)!(2n+1)! / (n! (n+1)!)^2.