44186

Appears in sequences

• Antidiagonal sums of square table A089447, which lists the coefficients of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.at n=8A089449
• Number of nX2 arrays of occupancy after each element moves to some king-move neighbor, with no 2-loops and with no occupancy greater than 2.at n=5A221338
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, with no 2-loops and with no occupancy greater than 2.at n=22A221341
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, with no 2-loops and with no occupancy greater than 2.at n=26A221341
• Number of (n+1) X (2+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A237406
• Number of (n+1) X (4+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237408
• T(n,k)=Number of (n+1) X (k+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=11A237412
• T(n,k)=Number of (n+1) X (k+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=13A237412
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 275", based on the 5-celled von Neumann neighborhood.at n=40A271093
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 347", based on the 5-celled von Neumann neighborhood.at n=40A271299
• Number of n X n 0..1 arrays with every element equal to 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=6A298896
• Number of nX7 0..1 arrays with every element equal to 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=6A298901