617760

Appears in sequences

• Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.at n=26A048782
• a(n) = A092914(n)/n = the least integer value of (n-1)!/(n*k!).at n=8A092916
• a(n)=[(n+1)(n+2)(n+3)...(2n)]/(1+2+3+...+n).at n=6A110371
• Magic products of 5 X 5 multiplicative magic squares.at n=25A111031
• Triangle T(n,k) = n!/(k!*(n-3*k)!), for n >= 3*k >= 0, read by rows.at n=37A118394
• a(n) is found from a(n-1) by dividing by D-1 and multiplying by D, where D is the smallest number that is not a divisor of a(n-1).at n=40A133582
• a(n) = smallest k such that A141501(k) = 2*n+1.at n=34A143474
• Triangle read by rows, T(n,k) = (n+k+1)! / ([(n-k)/2]! * [(n+k+2)/2]!) with [.] the floor function, for n>=0 and 0<=k<=n.at n=40A275212
• Expansion of e.g.f. 1 / ( 1 - Sum_{k>=0} x^(5*k+2) / (5*k+2)! ).at n=13A365909