30072

Appears in sequences

• a(n) = (1+n)*(9 + 11*n + 4*n^2)/3.at n=27A172482
• Number of length n arrays x(i), i=1..n with x(i) in i..i+7 and no value appearing more than 2 times.at n=4A250350
• Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 2 times.at n=6A250354
• Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=7A259003
• Number of nX5 0..1 arrays with every element equal to 0, 1, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A300027
• Number of nX7 0..1 arrays with every element equal to 0, 1, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A300029
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=59A300030
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=61A300030
• Take apart the sides of each of the integer-sided scalene triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total surface area of all rectangular prisms enclosed in this way.at n=41A308235
• Triangle read by rows: T(n,k) = A(k,n-k), 1 <= k < n, 2 <= n, where A(m,n) is the number of distinct strings consisting of one X, 2*m-1 Y's and 2*n-1 Z's in which the X lies to the right of at least m Y's and at least n Z's.at n=30A351583
• Triangle read by rows: T(n,k) = A(k,n-k), 1 <= k < n, 2 <= n, where A(m,n) is the number of distinct strings consisting of one X, 2*m-1 Y's and 2*n-1 Z's in which the X lies to the right of at least m Y's and at least n Z's.at n=33A351583
• Triangular array read by rows: T(n,k) is the number of n-node Stanley graphs containing exactly k connected components, n>=0, 0<=k<=n.at n=39A383656