41658

Appears in sequences

• Let f(z) = z^2 + c, then row k lists the expansion of the n-fold composition f(f(...f(0)...)) in rising powers of c.at n=55A137560
• Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set.at n=45A202019
• a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=2, a(1)=1, a(2)=2.at n=18A214899
• Number of binary search trees (BST) on n nodes which have the same height as the optimal BST.at n=17A328349
• Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns.at n=33A335920