43680

Appears in sequences

• a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=32A000447
• Number of labeled rooted trees of height 4 with n nodes.at n=2A000553
• Degrees of irreducible representations of Fischer group Fi22.at n=11A003913
• Binomial coefficient C(5n,n-10).at n=3A004352
• Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=30A006145
• Smallest k such that sigma(x) = k has exactly n solutions.at n=42A007368
• Area of more than one Pythagorean triangle.at n=32A009127
• sec(tan(x)*log(x+1))=1+12/4!*x^4-60/5!*x^5+570/6!*x^6-3780/7!*x^7...at n=8A012359
• Expansion of 1/((1-2*x)*(1-8*x)).at n=5A016131
• Binomial coefficients C(n,62).at n=3A017726
• Binomial coefficients C(65,n).at n=3A017781
• a(n) = A027144(2n-1, n-2).at n=6A027149
• a(n) = (prime(n) - 1)*(prime(n) - 3)*(prime(n) - 5)/48.at n=30A030004
• Triangle read by rows giving number of rooted labeled trees with n >= 2 nodes and height d >= 1.at n=18A034855
• a(n) = n!*(3*n^2 - 15*n + 10)/6.at n=3A034861
• a(n) = n!*(3*n^2 - 15*n + 10)/6, n > 4.at n=3A034862
• There are exactly n integer-sided triangles of area a(n).at n=29A051586
• a(n) = (3^(n+1)-1)*n!/2.at n=5A052577
• Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3).at n=16A052762
• a(n) = n*(n-1)*(n-2)*(n-3) for n>=5.at n=16A052768