157500

Appears in sequences

• A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=30A049326
• a(n) = n^4*binomial(2*n,n).at n=5A069121
• a(n) = (4*0^n + 5^n*binomial(2*n,n))/5.at n=5A099046
• Partial sums of A011757.at n=38A109770
• a(n) = n^2*binomial(2*n, n)*Fibonacci(n)^2.at n=5A119699
• a(n) = n^3*binomial(2*n, n)*Fibonacci(n).at n=5A119703
• Triangle read by rows: T(n,k) = count of increasing runs in two concatenated k-permutations of [n].at n=23A122823
• Numbers m that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (m raised to k+1 must not be a multiple). Case k=15.at n=8A135200
• Numbers with prime factorization pq^2r^2s^4.at n=27A190319
• Triangle read by rows: terms T(n,k) of a binomial decomposition of n*(n-1) as Sum(k=0..n)T(n,k).at n=34A244139
• Triangle read by rows, T(n, k) = Pochhammer(n, k) * Stirling2(2*n, k + n) for n >= 0 and 0 <= k <= n.at n=18A293926
• a(n) = n * A276086(n).at n=28A324580
• Least common multiple of n and A276086(n).at n=28A328584
• a(n) is the smallest integer that has exactly n divisors from A333369.at n=24A355771
• Triangle read by rows: T(n, k) = binomial(n, k - 1)*(k - 1)^(k - 1)*k*(n - k + 1)^(n - k).at n=31A369019
• a(n) is the conjectured largest number such that both a(n) and a(n) - n are 7-smooth numbers. a(n) can be less than n. Otherwise, if no such number exists then a(n) = 0.at n=35A376924