28030

Appears in sequences

• Number of n X 2 0..6 arrays with values 0..6 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=6A198649
• T(n,k)=Number of nXk 0..6 arrays with values 0..6 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=29A198654
• T(n,k)=Number of nXk 0..6 arrays with values 0..6 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=34A198654
• Number of nX2 0..7 arrays with values 0..7 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=6A198656
• T(n,k)=Number of nXk 0..7 arrays with values 0..7 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=29A198661
• T(n,k)=Number of nXk 0..7 arrays with values 0..7 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=34A198661
• Triangle, read by rows, such that row n equals the coefficients of x^(n^2+n-1+k) in F(x,n) for k = 1..n, where F(x,n) = (1 + x*F(x,n))*(1 + x^n/F(x,n)), for n>=1.at n=39A200171
• Column 4 of triangle A200171.at n=5A200173
• The PDO_t(n) function (Number of tagged parts over all the partitions of n with designated summands in which all parts are odd).at n=33A293422