46928

Appears in sequences

• a(n) = number of integer strings s(0),...,s(n) counted by array T in A026374 that have s(n)=4; also a(n) = T(2n,n-2).at n=6A026377
• a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+2), with T given by A026374.at n=6A026948
• T(n,n-5), array T as in A038792.at n=23A038795
• Riordan array (1/sqrt(1-6x+5x^2),(1-3x-sqrt(1-6x+5x^2))/(2x)).at n=38A110165
• Number of ways to build a contiguous building with n LEGO blocks of size 2 X 3 on top of a fixed block of the same size so that the building is symmetric after a rotation by 180 degrees.at n=6A123827
• The number of degree sequences with degree sum 2n representable by a non-separable graph (with multiple edges allowed).at n=26A147877
• Triangle related to the o.g.f.s. of the right hand columns of A163934 (E(x,m=4,n)).at n=18A163939
• Number of (n+1)X(1+1) 0..1 arrays with every element equal to some horizontal, vertical, diagonal or antidiagonal neighbor, with top left element zero.at n=7A231950
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every element equal to some horizontal, vertical, diagonal or antidiagonal neighbor, with top left element zero.at n=28A231957
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every element equal to some horizontal, vertical, diagonal or antidiagonal neighbor, with top left element zero.at n=35A231957
• Number of nX4 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=8A240515
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=46A298280
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=46A299067
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=46A299142
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=46A299373
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=46A299728
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=46A299839
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=46A299937
• Expansion of e.g.f. 1/(1 - 2 * x * cos(x))^(1/2).at n=7A385310