25945

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, 0, 0), (1, 0, -1), (1, 1, -1), (1, 1, 1)}.at n=8A149726
• Triangle: m=5; e(n,k,n)=(k + m - 1)*e(n - 1, k, m) + (m*n - k + 1 - m)*e(n - 1, k - 1, m); t(n,k)=e(n,k,m)+e(n,n-k,m).at n=17A156188
• Triangle: m=5; e(n,k,n)=(k + m - 1)*e(n - 1, k, m) + (m*n - k + 1 - m)*e(n - 1, k - 1, m); t(n,k)=e(n,k,m)+e(n,n-k,m).at n=18A156188
• Expansion of (1/(1-x-2x^2))*c(x/(1-x-2x^2)), c(x) the g.f. of A000108.at n=8A179533
• Number of (n+1) X 3 0..3 arrays with every 2 X 2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..3 introduced in row major order.at n=2A206377
• Number of (n+1)X4 0..3 arrays with every 2X2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..3 introduced in row major order.at n=1A206378
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..3 introduced in row major order.at n=7A206383
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..3 introduced in row major order.at n=8A206383
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 419", based on the 5-celled von Neumann neighborhood.at n=33A272047
• Numbers k such that k!6 + 6 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=25A287956
• a(n) = Sum_{k=0..floor(n/3)} (-1)^k * (n-k)!/(k! * (n-3*k)!).at n=14A358613
• Irregular triangle read by rows: T(n,k) is the sum of the widths of the free polyominoes with n cells and width k, n >= 1, 1 <= k <= ceiling(n/2).at n=34A379637