29070

Appears in sequences

• Number of protruded partitions of n with largest part at most 6.at n=16A005407
• Number of distinct perforation patterns for deriving (v,b) = (n+3,n) punctured convolutional codes from (2,1).at n=7A007224
• a(n) = 2*det(M(n; -1))/det(M(n; 0)), where M(n; m) is the n X n matrix with (i,j)-th element equal to 1/binomial(n + i + j + m, n).at n=7A007226
• Theta series of A_19 lattice.at n=2A023910
• Theta series of A*_19 lattice.at n=80A023931
• Duplicate of A007226.at n=7A024484
• a(n) = Sum_{k=0..n} (k+1) * A026714(n, k).at n=10A027205
• a(n) = n*(n+1)*(n+2)*(n+3)/4.at n=17A033487
• a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).at n=15A065346
• Integers that are Rhonda numbers to base 16.at n=9A100975
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level k (1<=k<=n). 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=28A121445
• Number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level 1.at n=7A121446
• A084175 interleaved with 2*A084175.at n=17A138477
• Left edge of the triangle in A033291.at n=44A192735
• Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=16A207363
• Number of intersections of diagonals in the exterior of a regular n-gon.at n=27A211382
• Numbers n such that the sum of the distinct prime divisors of n that are congruent to 1 mod 4 equals the sum of the distinct prime divisors congruent to 3 mod 4.at n=16A215949
• Triangle where the g.f. for row n equals d^n/dx^n (1+x+x^2)^n / n! for n>=0, as read by rows.at n=46A220178
• Array t(n,k) = binomial(n*k, n+1)/n, where n >= 1 and k >= 2, read by ascending antidiagonals.at n=29A241262
• Numbers that are both interprime and oblong.at n=41A263676