56448

Appears in sequences

• Number of ways of writing n as a sum of 8 squares.at n=15A000143
• Theta series of E_8 lattice with respect to deep hole.at n=14A004017
• Theta series of {D_8}* lattice.at n=15A008427
• Theta series of A_6 lattice.at n=39A008446
• Even pentagonal pyramidal numbers.at n=36A015224
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (3,k)-perfect numbers.at n=27A019292
• Words over signatures (derived from multisets and multinomials).at n=44A035796
• Number of labeled loops (quasigroups with an identity element).at n=5A057997
• Least solution to cototient(x) = n!, where cototient(x) = x-phi(x).at n=7A066278
• Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=20A074310
• a(n) = 4n^3 + 2n^2.at n=23A089207
• a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.at n=15A092820
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.at n=40A114655
• Even refactorable numbers k such that the number r of odd divisors and the number s of even divisors are both odd divisors of k and k is the first number for which the triple (r,s,t) occurs, where t is the number of divisors of k.at n=8A120358
• Even refactorable numbers k such that the number r of odd divisors of k and the number s of even divisors of k are both odd divisors of k.at n=24A120361
• Delannoy paths counted by number of weak peaks.at n=48A133214
• Generator for the finite sequence A038178.at n=19A135480
• A triangle of polynomial coefficients related to Mittag-Leffler polynomials: p(x,n)=Sum[Binomial[n, k]*Binomial[n - 1, n - k]*2^k*x^k, {k, 0, n}]/(2*x).at n=39A156136
• a(n+1) = 2*a(n) + 16*a(n-1), a(0)=0, a(1)=1.at n=8A161007
• Partial sums of A046878.at n=15A177737