17952

Appears in sequences

• Maximal length of rook tour on an n X n board.at n=29A006071
• exp(arcsinh(x)*arcsinh(x))=1+2/2!*x^2+4/4!*x^4+8/6!*x^6-240/8!*x^8...at n=5A012648
• Theta series of 17-dimensional lattice Q_17(6)^{+6}.at n=29A015161
• a(n) = n*(n+1)*(n+2)/2.at n=32A027480
• a(n) = lcm(n,n+1,n+2).at n=31A033931
• Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.at n=43A053199
• Least k for which the integers Floor(k/(m*(m+1))) for m=1,2,...,n are distinct.at n=36A054061
• Triangular array T: put T(n,0)=n for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.at n=52A054144
• Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=26A070980
• Product of all n - d, where d < n and d is a divisor of n.at n=33A072513
• Rearrangement of positive integers so that the successive ratios (of the larger to the smaller term) are all distinct integers. a(m)/a(m-1) = a(k)/a(k-1) iff m = k (assuming a(m) > a(m-1), otherwise the ratio a(m-1)/a(m) is to be considered). Priority is given to smallest number not included earlier rather than to the successive ratio that has not occurred earlier.at n=44A084337
• a(n) = n*(n^2 - 1)/2.at n=33A135503
• G.f.: -2*(-2 - 11*x - 4*x^2 + x^3)/(x - 1)^4.at n=14A152110
• Maximal length of rook tour on an n X n+2 board.at n=28A152133
• a(0)=1, a(n) = (3n-1)*3n*(3n+1)/2 for n>0.at n=11A157024
• a(n) = 17*n*(n+1).at n=32A173308
• Numbers of the form p^5*q*r*s where p, q, r, and s are distinct primes.at n=18A179704
• a(n) = Sum_{k=1..n} k*binomial(n, k)^3*(n^2 + n - k*n - k + k^2)/((n - k + 1)^2*n).at n=5A201640
• Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n.at n=35A211140
• Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and 2w^2>x^2+y^2.at n=17A211632