50788

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=59A137560
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (-1, 1, 1), (1, 0, -1), (1, 0, 1)}.at n=9A149312
• Number of (n+2) X 6 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=20A190028
• Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set.at n=41A202019
• Number of parts in all partitions of n with largest multiplicity six.at n=35A320376
• Number of (binary) max-heaps on n elements from the set {0,1} containing exactly ten 0's.at n=21A326511
• Number of binary search trees (BST) on n nodes which have the same height as the optimal BST.at n=21A328349
• 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=37A335920