59160

Appears in sequences

• a(n) = 1728*n - 1320.at n=34A157263
• Number of 3-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=34A187047
• Number of (n+1)X(2+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=4A250586
• Number of (n+1)X(5+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=1A250589
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=16A250592
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=19A250592
• a(n) = (-i)^n * Integral_{x>=0} H_n(i*x) * exp(-x), where H_n(x) is n-th Hermite polynomial, i=sqrt(-1).at n=6A277472
• a(n) = phi(n^5 - 1)/5 where phi is A000010.at n=13A319214
• a(n) is the least k that is a multiple of A071395(n) (the n-th primitive abundant number) for which A003961(k) is abundant.at n=39A337469
• a(n) is the smallest number which can be represented as the sum of 4 distinct nonzero tetrahedral numbers in exactly n ways, or -1 if no such number exists.at n=35A374809