61740

Appears in sequences

• sigma_3(n): sum of cubes of divisors of n.at n=37A001158
• Sum of cubes of unitary divisors of n.at n=37A034677
• Number of 8 X 8 binary matrices with n=0..64 ones up to row and column permutations.at n=13A053305
• Dirichlet inverse of sigma_3 function (A001158).at n=37A053825
• a(n) = 5^n-4^n-1.at n=6A054401
• a(n) = n^3*Product_{distinct primes p dividing n} (1+1/p^3).at n=37A065959
• a(0)=1, a(n) = sigma_3(2n).at n=19A091986
• a(n) = sigma_3(3n+2).at n=12A092343
• a(n) = n * (n+1)^2 * (n+2)^3.at n=5A101213
• Negative value of coefficient of x^(n-2) in the characteristic polynomial of a certain n X n integer circulant matrix.at n=26A127407
• a(n) = n*A007504(n)/2 = n*(sum of first n primes)/2.at n=40A156778
• Totally multiplicative sequence with a(p) = 7*(p+2) for prime p.at n=41A167308
• Totally multiplicative sequence with a(p) = 7*(p+3) for prime p.at n=17A167326
• Triangle T(n, k) = round(c(n)/(c(k)*c(n-k))) where c(n) = ((n-1)! * n! * (n+1)!)/ 2^(n-1) if n >= 2, otherwise 1, read by rows.at n=39A174150
• Triangle T(n, k) = round(c(n)/(c(k)*c(n-k))) where c(n) = ((n-1)! * n! * (n+1)!)/ 2^(n-1) if n >= 2, otherwise 1, read by rows.at n=41A174150
• Numbers with prime factorization p*q^2*r^2*s^3 (where p, q, r, s are distinct primes).at n=26A190109
• Coefficient of x in the reduction of the n-th Fibonacci polynomial by x^3->x^2+2x+1.at n=14A192773
• q-expansion of modular form psi_0^4/t_{3B}.at n=38A198956
• Expansion of (E_4(q) - E_4(q^5)) / 240 in powers of q where E_4 is an Eisenstein series.at n=37A226333
• Integer areas of the intangents triangle of integer-sided triangles.at n=13A231740