68922

Appears in sequences

• sigma_3(n): sum of cubes of divisors of n.at n=40A001158
• Expansion of 8-dimensional cusp form.at n=41A002408
• Numerator of sum of -3rd powers of divisors of n.at n=40A017669
• Sum of cubes of unitary divisors of n.at n=40A034677
• a(n) = sigma_3(2*n+1).at n=20A045823
• a(n) = Sum_{d|n, d=1 mod 4} d^3.at n=40A050451
• a(n) = Sum_{d|n, d==1 mod 4} d^3 - Sum_{d|n, d==3 mod 4} d^3.at n=40A050459
• Sum of cubes of odd divisors of n.at n=40A051000
• a(n) = Sum_{d divides n} (-1)^(n/d+1)*d^3.at n=40A078307
• a(n) = sigma_3(3n+2).at n=13A092343
• Numerator of Euler(n,7).at n=6A157835
• q-expansion of modular form psi_0^4/t_{3B}.at n=41A198956
• Number of ways of writing n as the sum of 9 triangular numbers.at n=26A226253
• Expansion of (E_4(q) - E_4(q^5)) / 240 in powers of q where E_4 is an Eisenstein series.at n=40A226333
• Number of length 1+2 0..n arrays with no pair in any consecutive three terms totaling exactly n.at n=40A245996
• a(n) = Euler(n, n+1) * 2^valuation(n+1, 2), where Euler(n, x) denotes the Euler polynomial.at n=6A291982
• L.g.f.: -log(Product_{k>=1} (1 - k*x^k)^k) = Sum_{n>=1} a(n)*x^n/n.at n=40A296601
• Image of n under the x^3+1 map, which is a variation of the 3x+1 (Collatz) map.at n=41A336911
• Sum of the cubes of the squarefree divisors of n.at n=40A351266
• The sum of unitary divisors of the smallest cubefull number that is a multiple of n.at n=40A369721