437580

Appears in sequences

• Apéry numbers: n*C(2*n,n).at n=9A005430
• a(1)=1; for n >= 1, a(n+1) = lcm(a(n),n) / gcd(a(n),n).at n=18A008339
• Triangle of coefficients of Legendre polynomials 2^n P_n (x).at n=31A008556
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-1)/2.at n=23A047178
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-2)/2.at n=23A047189
• Numbers k such that sigma(k+1) = 5*phi(k).at n=26A067263
• Triangular numbers which are 8-almost primes.at n=31A076582
• Highly composite triangular numbers: triangular numbers where the number of divisors increases to a record.at n=15A076711
• a(1) = 1, a(n) = lcm(n, a(n-1)) / gcd(n, a(n-1)).at n=17A077139
• Number of peaks at even level in all symmetric Dyck paths of semilength n+2.at n=17A088662
• a(n) = n * binomial(n-1, floor((n-1)/2)) = n * max_{i=0..n} binomial(n-1, i).at n=18A100071
• Expansion of 1/sqrt(1-4*x*y-4*x^2*y).at n=64A115951
• (Product{k|n} k$) / n$. Here '$' denotes the swinging factorial function (A056040).at n=34A163088
• a(n) = A185128(n) - A185129(n).at n=25A185253
• Triangular numbers that are the product of two triangular numbers greater than 1.at n=39A188630
• Numbers with prime factorization pqrst^2u^2.at n=13A190380
• The smallest number with n digits in its prime factorization (total count of digits of all bases and exponents).at n=10A192010
• a(n) = n!/([(n-1)/2]!*[(n+1)/2]!) for n>0, a(0)=0, and where [ ] = floor.at n=18A212303
• Number of profiles in domino tiling of a 2*n checkboard.at n=18A218073
• Triangular numbers that are the product of three distinct triangular numbers greater than 1.at n=33A225440