33785

Appears in sequences

• a(n) = n*(n+1)*(8*n + 1)/6.at n=29A132124
• Number of (n+2)X3 0..2 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly two different ways, and new values 0..2 introduced in row major order.at n=2A204947
• Number of (n+2)X5 0..2 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly two different ways, and new values 0..2 introduced in row major order.at n=0A204949
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly two different ways, and new values 0..2 introduced in row major order.at n=3A204954
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly two different ways, and new values 0..2 introduced in row major order.at n=5A204954
• The number of binary heaps on n elements whose breadth-first search reading word avoids 231.at n=14A246747
• a(n) is the smallest integer that can appear as the n-th term of two distinct nondecreasing sequences of positive integers that satisfy the Fibonacci recurrence relation.at n=12A286983
• Irregular triangle read by rows: T(n,k) (0 <= k <= n^2) are coefficients of cluster density function for site percolation on an n X n 2D nnsquare lattice with open boundary conditions.at n=38A365947