43662

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, 0, 1), (0, -1, 1), (0, 0, 1), (0, 1, 1), (1, 1, -1)}.at n=8A150583
• a(n) = 121*n^2 - n.at n=18A157960
• a(n) = 361*n^2 - 19.at n=10A158595
• Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=19A228964
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 969", based on the 5-celled von Neumann neighborhood.at n=31A273849
• Number of n X n 0..2 arrays with no element equal to any value at offset (-2,-1), (-1,1) or (0,-2) and new values introduced in order 0..2.at n=4A276242
• Number of nX5 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=4A276245
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=40A276248
• Number of 5Xn 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=4A276251
• Numerators of triangle related to enumeration of minimal 2-covers of a labeled n-set.at n=33A280752