55452

Appears in sequences

• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k if k <= floor(n/2) otherwise 2*(n-k), and m = 2, read by rows.at n=24A157277
• Number of n X n 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totaling two no more than once.at n=3A268621
• Number of n X 4 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.at n=3A268624
• T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.at n=24A268628
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 389", based on the 5-celled von Neumann neighborhood.at n=7A271595