cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A134040 a(0) = 1; for n>0, a(n) = number of binary partitions of the Catalan number A000108(n).

Original entry on oeis.org

1, 2, 4, 14, 140, 4964, 808870, 726210606, 4161522164020, 170403742275382924, 54674613696351170731038, 148019646825727958873435181692, 3596203368022579371689526442266893534
Offset: 0

Views

Author

Paul D. Hanna, Oct 02 2007

Keywords

Examples

			a(0)=1, a(1)=A000123(1)=2, a(2)=A000123(2)=4, a(3)=A000123(5)=14, a(4)=A000123(14)=140.
		

Crossrefs

Formula

a(n) = A000123( A000108(n) ) for n>0 with a(0)=1, where A000108(n) = C(2*n,n)/(n+1) (Catalan numbers) and A000123(n) = number of partitions of 2n into powers of 2.