

A185155


Irregular triangle read by rows: Catalan coefficients T(n,k), n>=0, 0 <= k <= C_n, where C_n = A000108(n).


0



1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 4, 3, 2, 3, 4, 1, 1, 6, 6, 1, 1, 4, 3, 2, 3, 4, 1, 1, 8, 8, 1, 1, 4, 3, 2, 3, 4, 1, 1, 6, 6, 1, 1, 4, 3, 2, 3, 4, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,7


COMMENTS

Let k = number of splits  Think of the first split as a bisection of our space, say the unit interval, the second split can be either bisecting the left half or the right half from the first split, etc. Alternatively, think of a "spatial binary branching process" or plane trees.
Let C_k = number of distinct spacepartitioning binary trees made from k splits (the Catalan number).
k! = number of ways in which we can reach any of the distinct spacepartitioning binary trees attained by k splits, i.e., the total number of distinct paths in the Hasse Diagram representing the splitbased transition diagram that is representing the growth of such spacepartitioning binary trees.
"Catalan Coefficients" is the number of distinct paths from the unique root tree with 0 splits to each one of the C_k many distinct trees with k splits that are structurally labeled with elements from [C_k] := {0,1,2,...,C_k1}. Let these distinct path counts from the root tree be our coefficients B_k := (B_{k,0},B_{k,1},...,B_{k,C_k1}). Note that this recursion for B_k depends on B_{k1}, i.e., the number of distinct paths from the root tree with 0 splits to each distinct tree j in [C_{k1}] with k1 splits and the subset A_i of [C_{k1}] of trees with k1 splits that can produce the tree i in [C_k] with k splits. Thus B_k = ( B_{k,0},B_{k,1},...,B_{k,C_k1} ), B_{k,i} = sum_{j in A_i} B_{k1,j}, sum_{i=0..C_k1}B_{k,i}=k!
The following B_k for k in {0,1,2,3,4,5} were handcomputed by Gloria Teng on Aug 21 2009 and verified by Raazesh Sainudiin.
k C_k k! (B_{k,0},B_{k,1},...,B_{k,C_k1})
0 1 1 1
1 1 1 1
2 2 2 1, 1
3 5 6 1, 1, 2, 1, 1
4 14 24 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1
5 42 120 1, 1, 4, 3, 2, 3, 4, 1, 1, 6, 6, 1, 1, 4, 3, 2, 3, 4, 1, 1, 8, 8, 1, 1, 4, 3, 2, 3, 4, 1, 1, 6, 6, 1, 1, 4, 3, 2, 3, 4, 1, 1
6 132 720 ...
. .
. .
. .


REFERENCES

Raazesh Sainudiin, Statistical Regular Pavings in Bayesian Nonparametric Density Estimation, 2014; http://archytas.birs.ca/workshops/2014/14w5125/files/Sainudiin.pdf. See Slide 14.
R. Sainudiin, Algebra and Arithmetic of Plane Binary Trees, Slides of a talk, 2014; http://www.math.canterbury.ac.nz/~r.sainudiin/talks/MRP_UCPrimer2014.pdf
R. Sainudiin, Some Arithmetic, Algebraic and Combinatorial Aspects of Plane Binary Trees, Slides from a talk, Oct 27 2014; http://www.math.canterbury.ac.nz/~r.sainudiin/talks/20141027_AriAlgComPBT_CornellDGCSeminar.pdf


LINKS

Table of n, a(n) for n=0..64.
Raazesh Sainudiin, William Taylor, and Gloria Teng, Catalan Coefficients
R Sainudiin, A Veber, A Betasplitting model for evolutionary trees, arXiv preprint arXiv:1511.08828, 2015


CROSSREFS

Cf. A000108.
Sequence in context: A063420 A254631 A029385 * A249095 A026536 A046213
Adjacent sequences: A185152 A185153 A185154 * A185156 A185157 A185158


KEYWORD

nonn,tabf


AUTHOR

Raazesh Sainudiin, Feb 28 2012


EXTENSIONS

Edited by N. J. A. Sloane, Sep 13 2016


STATUS

approved



