375000

Appears in sequences

• Duplicate of A052562.at n=5A047054
• a(n) = 5^n * n!.at n=5A052562
• a(n) = n^n * n!.at n=5A061711
• Product of numbers <= n that have a prime factor in common with n.at n=24A066570
• Quintuple factorials, 5-factorials, n!!!!!, n!5.at n=25A085157
• a(n) = n^4 - n^3.at n=25A085537
• a(n) = n*(n + 1)^3.at n=24A085540
• Numbers n that are the hypotenuse of exactly 6 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 6 ways.at n=17A097219
• Triangle T(n,k) read by rows: number of permutations in S_n avoiding all k-length patterns starting with fixed m, 2<k<=n, 1<=m<=k.at n=39A104001
• Numbers n such that the period length P(n) of the Fibonacci sequence mod n is a multiple of n.at n=42A105953
• a(n) is the product of the positive integers each of which is <= n and is divisible by exactly one prime dividing n (but is coprime to every other prime dividing n). (a(1) = 1).at n=24A119794
• a(n) = (n^3 - n)*5^n.at n=4A128963
• Table T(n,k) = n!*k^n, read by upwards antidiagonals.at n=60A131182
• Sequence identical to its third differences in absolute values.at n=23A138278
• Triangle read by rows: T(n,k) = n^k * k!.at n=20A153188
• Triangle T(n, k) = Product_{j=0..k} (j*n + prime(m)), with T(n, 0) = prime(m) and m = 3, read by rows.at n=19A153271
• Number of permutations of 1..n with i-9<=p(i)<=i+4.at n=9A179357
• Number of permutations of 1..n with i-10<=p(i)<=i+4.at n=9A179364
• Number of permutations of [n] avoiding ascents from odd to even numbers.at n=10A231601
• Number T(n,k) of permutations of [n] with exactly k ascents from odd to even numbers; triangle T(n,k), n>=0, 0<=k<=floor(n/2), read by rows.at n=30A231777