61236

Appears in sequences

• a(n) = (11*n+1)*(11*n+10).at n=22A001536
• Triangle of coefficients in expansion of (1+3*x)^n.at n=51A013610
• Cube of lower triangular normalized binomial matrix.at n=48A027465
• Expansion of 1/(1 - 3*x)^4; 4-fold convolution of A000244 (powers of 3).at n=6A036216
• Expansion of 1/(1-3*x)^6; 6-fold convolution of A000244 (powers of 3).at n=5A036219
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*12^j.at n=29A038230
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*3^j.at n=34A038329
• Invert transform applied twice to Pascal's triangle A007318.at n=38A055373
• Invert transform applied twice to Pascal's triangle A007318.at n=42A055373
• Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 1.at n=48A059297
• Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 2.at n=38A059298
• Triangle of idempotent numbers (version 3), T(n, k) = binomial(n, k) * (n - k)^k.at n=51A059299
• Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 4.at n=42A059300
• Number of nonterminal symbols in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.at n=17A092284
• a(n) = 3^n*(2*n)!/(n!)^2.at n=5A098658
• Expansion of e.g.f. BesselI(0,2*sqrt(3)*x) + BesselI(1,2*sqrt(3)*x)/sqrt(3).at n=10A098662
• Expansion of (sqrt(1-12*x^2)+12*x^2+2*x-1)/(2*x*sqrt(1-12*x^2)).at n=10A103978
• a(n) = 3^5 * binomial(n+4, 5).at n=5A113335
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k leaves (i.e., vertices of degree 0; n>=0, k>=1). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=25A120429
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 1 (n >= 0, k >= 0).at n=42A120981