28328

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 0, 1), (1, 0, 1), (1, 1, 0)}.at n=8A150384
• Number of 3-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=22A186852
• Number of n X n 0..6 matrices whose square is also a 0..6 matrix.at n=2A213988
• T(n,k)=Number of n X n 0..k matrices whose square is also a 0..k matrix.at n=30A213990
• Number of 3X3 0..n matrices whose square is also a 0..n matrix.at n=5A213992
• Number of (n+1)X(1+1) 0..5 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 10.at n=3A234084
• Number of (n+1)X(4+1) 0..5 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 10.at n=0A234087
• T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 10 (10 maximizes T(1,1)).at n=6A234091
• T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 10 (10 maximizes T(1,1)).at n=9A234091
• Records in A171898.at n=21A309813
• G.f. A(x) satisfies: A(x)^4 = (1-x) * (A(x) + x)^3.at n=7A352413
• Minimum base in which the least number with absolute multiplicative persistence n achieves such persistence.at n=36A385727