18662400

Appears in sequences

• Card-matching numbers (Dinner-Diner matching numbers).at n=38A059065
• Least number whose number of divisors is A007304(n) (the n-th number that is the product of 3 distinct primes).at n=21A061299
• Least m with n*(n+1)/2 divisors.at n=20A081620
• a(n) = (n*n!)^2.at n=5A176128
• Number of (n+2)X5 binary arrays avoiding patterns 001 and 011 in rows and columns.at n=11A202095
• Permanent of the n-th principal submatrix of (A134446 in square format).at n=5A203264
• Vandermonde determinant of the first n numbers (1,3,4,6,7,9,10,...) = (j+floor(j/2)).at n=5A203430
• Cyclic quadrilateral numbers: numbers m = a*b*c*d such that the integers a,b,c,d are the sides of a cyclic quadrilateral whose area and circumradius are integers.at n=27A218431
• a(n) = [n/2]!*[(n+1)/2]!*C([n/2],1)*C([(n+1)/2],1).at n=11A226282
• [n/2]!*[(n+1)/2]!*C([n/2],5)*C([(n+1)/2],5).at n=11A226286
• Number of (n+1)X(4+1) 0..1 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=12A250428
• A multiplicative encoding (compressed) for the exponents of 2 obtained when using Shevelev's algorithm for computing A002326.at n=38A292265
• Positions of records in A050377, number of ways to factor n into "Fermi-Dirac primes" (A050376).at n=22A330687
• Numbers with a record number of divisors that are perfect powers (A091050).at n=35A330873