33656

Appears in sequences

• Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11.at n=3A233878
• Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11.at n=2A233879
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)).at n=17A233883
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)).at n=18A233883
• Triangle read by rows: T(n,k) = logarithmic polynomial A_k^(n)(x) evaluated at x=1.at n=38A260324
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 425", based on the 5-celled von Neumann neighborhood.at n=38A272091
• Binomial(n,4) - A290447(n).at n=45A290461
• Number of palindromic plane trees with n nodes.at n=18A319436
• a(n) = n! * Sum_{k=0..floor(n/3)} (-1)^k / (3*k)!.at n=8A348597
• Number of integer partitions of n where the parts have lesser mean than the distinct parts.at n=40A360251