A006352 -id:A006352 - cp's OEIS frontend

A000203 a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).

1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 60, 31, 42, 40, 56, 30, 72, 32, 63, 48, 54, 48, 91, 38, 60, 56, 90, 42, 96, 44, 84, 78, 72, 48, 124, 57, 93, 72, 98, 54, 120, 72, 120, 80, 90, 60, 168, 62, 96, 104, 127, 84, 144, 68, 126, 96, 144

Offset: 1

N. J. A. Sloane

Multiplicative: If the canonical factorization of n into prime powers is the product of p^e(p) then sigma_k(n) = Product_p ((p^((e(p)+1)*k))-1)/(p^k-1).
Sum_{d|n} 1/d^k is equal to sigma_k(n)/n^k. So sequences A017665-A017712 also give the numerators and denominators of sigma_k(n)/n^k for k = 1..24. The power sums sigma_k(n) are in sequences A000203 (this sequence) (k=1), A001157-A001160 (k=2,3,4,5), A013954-A013972 for k = 6,7,...,24. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 05 2001
A number n is abundant if sigma(n) > 2n (cf. A005101), perfect if sigma(n) = 2n (cf. A000396), deficient if sigma(n) < 2n (cf. A005100).
a(n) is the number of sublattices of index n in a generic 2-dimensional lattice. - Avi Peretz (njk(AT)netvision.net.il), Jan 29 2001 [In the language of group theory, a(n) is the number of index-n subgroups of Z x Z. - Jianing Song, Nov 05 2022]
The sublattices of index n are in one-to-one correspondence with matrices [a b; 0 d] with a>0, ad=n, b in [0..d-1]. The number of these is Sum_{d|n} d = sigma(n), which is a(n). A sublattice is primitive if gcd(a,b,d) = 1; the number of these is n * Product_{p|n} (1+1/p), which is A001615. [Cf. Grady reference.]
Sum of number of common divisors of n and m, where m runs from 1 to n. - Naohiro Nomoto, Jan 10 2004
a(n) is the cardinality of all extensions over Q_p with degree n in the algebraic closure of Q_p, where p>n. - Volker Schmitt (clamsi(AT)gmx.net), Nov 24 2004. Cf. A100976, A100977, A100978 (p-adic extensions).
Let s(n) = a(n-1) + a(n-2) - a(n-5) - a(n-7) + a(n-12) + a(n-15) - a(n-22) - a(n-26) + ..., then a(n) = s(n) if n is not pentagonal, i.e., n != (3 j^2 +- j)/2 (cf. A001318), and a(n) is instead s(n) - ((-1)^j)*n if n is pentagonal. - Gary W. Adamson, Oct 05 2008 [corrected Apr 27 2012 by William J. Keith based on Ewell and by Andrey Zabolotskiy, Apr 08 2022]
Write n as 2^k * d, where d is odd. Then a(n) is odd if and only if d is a square. - Jon Perry, Nov 08 2012
Also total number of parts in the partitions of n into equal parts. - Omar E. Pol, Jan 16 2013
Note that sigma(3^4) = 11^2. On the other hand, Kanold (1947) shows that the equation sigma(q^(p-1)) = b^p has no solutions b > 2, q prime, p odd prime. - N. J. A. Sloane, Dec 21 2013, based on postings to the Number Theory Mailing List by Vladimir Letsko and Luis H. Gallardo
Limit_{m->infinity} (Sum_{n=1..prime(m)} a(n)) / prime(m)^2 = zeta(2)/2 = Pi^2/12 (A072691). See more at A244583. - Richard R. Forberg, Jan 04 2015
a(n) + A000005(n) is an odd number iff n = 2m^2, m>=1. - Richard R. Forberg, Jan 15 2015
a(n) = a(n+1) for n = 14, 206, 957, 1334, 1364 (A002961). - Zak Seidov, May 03 2016
Equivalent to the Riemann hypothesis: a(n) < H(n) + exp(H(n))*log(H(n)), for all n>1, where H(n) is the n-th harmonic number (Jeffrey Lagarias). See A057641 for more details. - Ilya Gutkovskiy, Jul 05 2016
a(n) is the total number of even parts in the partitions of 2*n into equal parts. More generally, a(n) is the total number of parts congruent to 0 mod k in the partitions of k*n into equal parts (the comment dated Jan 16 2013 is the case for k = 1). - Omar E. Pol, Nov 18 2019
From Jianing Song, Nov 05 2022: (Start)
a(n) is also the number of order-n subgroups of C_n X C_n, where C_n is the cyclic group of order n. Proof: by the correspondence theorem in the group theory, there is a one-to-one correspondence between the order-n subgroups of C_n X C_n = (Z x Z)/(nZ x nZ) and the index-n subgroups of Z x Z containing nZ x nZ. But an index-n normal subgroup of a (multiplicative) group G contains {g^n : n in G} automatically. The desired result follows from the comment from Naohiro Nomoto above.
The number of subgroups of C_n X C_n that are isomorphic to C_n is A001615(n). (End)

			For example, 6 is divisible by 1, 2, 3 and 6, so sigma(6) = 1 + 2 + 3 + 6 = 12.
Let L = <V,W> be a 2-dimensional lattice. The 7 sublattices of index 4 are generated by <4V,W>, <V,4W>, <4V,W+-V>, <2V,2W>, <2V+W,2W>, <2V,2W+V>. Compare A001615.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 38.
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 116ff.
Florian Cajori, A History of Mathematical Notations, Dover edition (2012), par. 407.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 162, #16, (6), 2nd formula.
G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, pp. 141, 166.
H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Fifth Edition, Clarendon Press, Oxford, 2003.
Ross Honsberger, "Mathematical Gems, Number One," The Dolciani Mathematical Expositions, Published and Distributed by The Mathematical Association of America, page 116.
Kanold, Hans Joachim, Kreisteilungspolynome und ungerade vollkommene Zahlen. (German), Ber. Math.-Tagung Tübingen 1946, (1947). pp. 84-87.
M. Krasner, Le nombre des surcorps primitifs d'un degré donné et le nombre des surcorps métagaloisiens d'un degré donné d'un corps de nombres p-adiques. Comptes Rendus Hebdomadaires, Académie des Sciences, Paris 254, 255, 1962.
A. Lubotzky, Counting subgroups of finite index, Proceedings of the St. Andrews/Galway 93 group theory meeting, Th. 2.1. LMS Lecture Notes Series no. 212 Cambridge University Press 1995.
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section III.1, page 77.
G. Pólya, Induction and Analogy in Mathematics, vol. 1 of Mathematics and Plausible Reasoning, Princeton Univ Press 1954, page 92.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 91, 395.
Robert M. Young, Excursions in Calculus, The Mathematical Association of America, 1992 p. 361.

Daniel Forgues, Table of n, a(n) for n = 1..100000 (first 20000 terms from N. J. A. Sloane)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
B. Apostol and L. Petrescu, Extremal Orders of Certain Functions Associated with Regular Integers (mod n), Journal of Integer Sequences, 2013, # 13.7.5.
Joerg Arndt, On computing the generalized Lambert series, arXiv:1202.6525v3 [math.CA], (2012).
M. Baake and U. Grimm, Quasicrystalline combinatorics
Henry Bottomley, Illustration of initial terms
C. K. Caldwell, The Prime Glossary, sigma function
Imanuel Chen and Michael Z. Spivey, Integral Generalized Binomial Coefficients of Multiplicative Functions, Preprint 2015; Summer Research Paper 238, Univ. Puget Sound.
D. Christopher and T. Nadu, Partitions with Fixed Number of Sizes, Journal of Integer Sequences, 15 (2015), #15.11.5.
J. N. Cooper and A. W. N. Riasanovsky, On the Reciprocal of the Binary Generating Function for the Sum of Divisors, 2012. - _N. J. A. Sloane_, Dec 25 2012
R. L. Duncan, Note on the Divisors of a Number, The American Mathematical Monthly, 68(4), 356-359, (1961).
Jason Earls, The Smarandache sum of composites between factors function, in Smarandache Notions Journal (2004), Vol. 14.1, page 243.
L. Euler, Discovery of a most extraordinary law of numbers, relating to the sum of their divisors
L. Euler, Observatio de summis divisorum
L. Euler, An observation on the sums of divisors, arXiv:math/0411587 [math.HO], 2004-2009.
J. A. Ewell, Recurrences for the sum of divisors, Proc. Amer. Math. Soc. 64 (2) 1977.
Farideh Firoozbakht and M. F. Hasler, Variations on Euclid's formula for Perfect Numbers, JIS 13 (2010) #10.3.1.
Daniele A. Gewurz and Francesca Merola, Sequences realized as Parker vectors ..., J. Integer Seqs., Vol. 6, 2003.
Johan Gielis and Ilia Tavkhelidze, The general case of cutting of GML surfaces and bodies, arXiv:1904.01414 [math.GM], 2019.
J. W. L. Glaisher, On the function chi(n), Quarterly Journal of Pure and Applied Mathematics, 20 (1884), 97-167.
J. W. L. Glaisher, On the function chi(n), Quarterly Journal of Pure and Applied Mathematics, 20 (1884), 97-167. [Annotated scanned copy]
M. J. Grady, A group theoretic approach to a famous partition formula, Amer. Math. Monthly, 112 (No. 7, 2005), 645-651.
Masazumi Honda and Takuya Yoda, String theory, N = 4 SYM and Riemann hypothesis, arXiv:2203.17091 [hep-th], 2022.
Douglas E. Iannucci, On sums of the small divisors of a natural number, arXiv:1910.11835 [math.NT], 2019.
Antti Karttunen, Scheme program for computing this sequence.
P. A. MacMahon, Divisors of numbers and their continuations in the theory of partitions, Proc. London Math. Soc., 19 (1921), 75-113.
M. Maia and M. Mendez, On the arithmetic product of combinatorial species, arXiv:math.CO/0503436, 2005.
K. Matthews, Factorizing n and calculating phi(n),omega(n),d(n),sigma(n) and mu(n)
Walter Nissen, Abundancy : Some Resources
P. Pollack and C. Pomerance, Some problems of Erdős on the sum-of-divisors function, For Richard Guy on his 99th birthday: May his sequence be unbounded, Trans. Amer. Math. Soc. Ser. B 3 (2016), 1-26; errata.
Carl Pomerance and Hee-Sung Yang, Variant of a theorem of Erdős on the sum-of-proper-divisors function, Math. Comp. 83 (2014), 1903-1913.
John S. Rutherford, The enumeration and symmetry-significant properties of derivative lattices, Act. Cryst. (1992) A48, 500-508. - _N. J. A. Sloane_, Mar 14 2009
John S. Rutherford, The enumeration and symmetry-significant properties of derivative lattices II, Acta Cryst. A49 (1993), 293-300. - _N. J. A. Sloane_, Mar 14 2009
John S. Rutherford, Sublattice enumeration. IV. Equivalence classes of plane sublattices by parent Patterson symmetry and colour lattice group type, Acta Cryst. (2009). A65, 156-163. [See Table 1]. - _N. J. A. Sloane_, Feb 23 2009
N. J. A. Sloane, "A Handbook of Integer Sequences" Fifty Years Later, arXiv:2301.03149 [math.NT], 2023, p. 3.
Eric Weisstein's World of Mathematics, Divisor Function
Wikipedia, Divisor function
Index entries for sequences related to sublattices
Index entries for sequences related to sigma(n)
Index entries for "core" sequences

See A034885, A002093 for records. Bisections give A008438, A062731. Values taken are listed in A007609. A054973 is an inverse function.
For partial sums see A024916.
Row sums of A127093.
sigma_i (i=0..25): A000005, A000203, A001157, A001158, A001159, A001160, A013954, A013955, A013956, A013957, A013958, A013959, A013960, A013961, A013962, A013963, A013964, A013965, A013966, A013967, A013968, A013969, A013970, A013971, A013972, A281959.
Cf. A144736, A158951, A158902, A174740, A147843, A001158, A001160, A001065, A002192, A001001, A001615 (primitive sublattices), A039653, A088580, A074400, A083728, A006352, A002659, A083238, A000593, A050449, A050452, A051731, A027748, A124010, A069192, A057641, A001318.
Cf. A009194, A082062 (gcd(a(n),n) and its largest prime factor), A179931, A192795 (gcd(a(n),A001157(n)) and largest prime factor).
Cf. also A034448 (sum of unitary divisors).
Cf. A007955 (products of divisors).
Cf. A144613, A144614, A144615, A146076.
A001227, A000593 and this sequence have the same parity: A053866. - Omar E. Pol, May 14 2016
Cf. A001221, A054533.

⍝ Dyalog dialect
A000203 ← +/{ð←⍵{(0=⍵|⍺)/⍵}⍳⌊⍵*÷2 ⋄ 1=⍵:ð ⋄ ð,(⍵∘÷)¨(⍵=(⌊⍵*÷2)*2)↓⌽ð} ⍝ Antti Karttunen, Feb 20 2024

A000203:=List([1..10^2],n->Sigma(n)); # Muniru A Asiru, Oct 01 2017

a000203 n = product $ zipWith (\p e -> (p^(e+1)-1) `div` (p-1)) (a027748_row n) (a124010_row n)
-- Reinhard Zumkeller, May 07 2012

Magma
```
[SumOfDivisors(n): n in [1..70]];
```

[DivisorSigma(1,n): n in [1..70]]; // Bruno Berselli, Sep 09 2015

with(numtheory): A000203 := n->sigma(n); seq(A000203(n), n=1..100);

Table[ DivisorSigma[1, n], {n, 100}]
a[ n_] := SeriesCoefficient[ QPolyGamma[ 1, 1, q] / Log[q]^2, {q, 0, n}]; (* Michael Somos, Apr 25 2013 *)

makelist(divsum(n),n,1,1000); /* Emanuele Munarini, Mar 26 2011 */

numlib::sigma(n)$ n=1..81 // Zerinvary Lajos, May 13 2008

PARI
```
{a(n) = if( n<1, 0, sigma(n))};
```

{a(n) = if( n<1, 0, direuler( p=2, n, 1 / (1 - X) /(1 - p*X))[n])};

{a(n) = if( n<1, 0, polcoeff( sum( k=1, n, x^k / (1 - x^k)^2, x * O(x^n)), n))}; /* Michael Somos, Jan 29 2005 */

max_n = 30; ser = - sum(k=1,max_n,log(1-x^k)); a(n) = polcoeff(ser,n)*n \\ Gottfried Helms, Aug 10 2009

from sympy import divisor_sigma
def a(n): return divisor_sigma(n, 1)
print([a(n) for n in range(1, 71)]) # Michael S. Branicky, Jan 03 2021

from math import prod
from sympy import factorint
def a(n): return prod((p**(e+1)-1)//(p-1) for p, e in factorint(n).items())
print([a(n) for n in range(1, 51)]) # Michael S. Branicky, Feb 25 2024

[sigma(n, 1) for n in range(1, 71)]  # Zerinvary Lajos, Jun 04 2009

(definec (A000203 n) (if (= 1 n) n (let ((p (A020639 n)) (e (A067029 n))) (* (/ (- (expt p (+ 1 e)) 1) (- p 1)) (A000203 (A028234 n)))))) ;; Uses macro definec from http://oeis.org/wiki/Memoization#Scheme - Antti Karttunen, Nov 25 2017

(define (A000203 n) (let ((r (sqrt n))) (let loop ((i (inexact->exact (floor r))) (s (if (integer? r) (- r) 0))) (cond ((zero? i) s) ((zero? (modulo n i)) (loop (- i 1) (+ s i (/ n i)))) (else (loop (- i 1) s)))))) ;; (Stand-alone program) - Antti Karttunen, Feb 20 2024

Multiplicative with a(p^e) = (p^(e+1)-1)/(p-1). - David W. Wilson, Aug 01 2001
For the following bounds and many others, see Mitrinovic et al. - N. J. A. Sloane, Oct 02 2017
If n is composite, a(n) > n + sqrt(n).
a(n) < n*sqrt(n) for all n.
a(n) < (6/Pi^2)*n^(3/2) for n > 12.
G.f.: -x*deriv(eta(x))/eta(x) where eta(x) = Product_{n>=1} (1-x^n). - Joerg Arndt, Mar 14 2010
L.g.f.: -log(Product_{j>=1} (1-x^j)) = Sum_{n>=1} a(n)/n*x^n. - Joerg Arndt, Feb 04 2011
Dirichlet convolution of phi(n) and tau(n), i.e., a(n) = sum_{d|n} phi(n/d)*tau(d), cf. A000010, A000005.
a(n) is odd iff n is a square or twice a square. - Robert G. Wilson v, Oct 03 2001
a(n) = a(n*prime(n)) - prime(n)*a(n). - Labos Elemer, Aug 14 2003 (Clarified by Omar E. Pol, Apr 27 2016)
a(n) = n*A000041(n) - Sum_{i=1..n-1} a(i)*A000041(n-i). - Jon Perry, Sep 11 2003
a(n) = -A010815(n)*n - Sum_{k=1..n-1} A010815(k)*a(n-k). - Reinhard Zumkeller, Nov 30 2003
a(n) = f(n, 1, 1, 1), where f(n, i, x, s) = if n = 1 then s*x else if p(i)|n then f(n/p(i), i, 1+p(i)*x, s) else f(n, i+1, 1, s*x) with p(i) = i-th prime (A000040). - Reinhard Zumkeller, Nov 17 2004
Recurrence: n^2*(n-1)*a(n) = 12*Sum_{k=1..n-1} (5*k*(n-k) - n^2)*a(k)*a(n-k), if n>1. - Dominique Giard (dominique.giard(AT)gmail.com), Jan 11 2005
G.f.: Sum_{k>0} k * x^k / (1 - x^k) = Sum_{k>0} x^k / (1 - x^k)^2. Dirichlet g.f.: zeta(s)*zeta(s-1). - Michael Somos, Apr 05 2003. See the Hardy-Wright reference, p. 312. first equation, and p. 250, Theorem 290. - Wolfdieter Lang, Dec 09 2016
For odd n, a(n) = A000593(n). For even n, a(n) = A000593(n) + A074400(n/2). - Jonathan Vos Post, Mar 26 2006
Equals the inverse Moebius transform of the natural numbers. Equals row sums of A127093. - Gary W. Adamson, May 20 2007
A127093 * [1/1, 1/2, 1/3, ...] = [1/1, 3/2, 4/3, 7/4, 6/5, 12/6, 8/7, ...]. Row sums of triangle A135539. - Gary W. Adamson, Oct 31 2007
a(n) = A054785(2*n) - A000593(2*n). - Reinhard Zumkeller, Apr 23 2008
a(n) = n*Sum_{k=1..n} A060642(n,k)/k*(-1)^(k+1). - Vladimir Kruchinin, Aug 10 2010
Dirichlet convolution of A037213 and A034448. - R. J. Mathar, Apr 13 2011
G.f.: A(x) = x/(1-x)*(1 - 2*x*(1-x)/(G(0) - 2*x^2 + 2*x)); G(k) = -2*x - 1 - (1+x)*k + (2*k+3)*(x^(k+2)) - x*(k+1)*(k+3)*((-1 + (x^(k+2)))^2)/G(k+1); (continued fraction). - Sergei N. Gladkovskii, Dec 06 2011
a(n) = A001065(n) + n. - Mats Granvik, May 20 2012
a(n) = A006128(n) - A220477(n). - Omar E. Pol, Jan 17 2013
a(n) = Sum_{k=1..A003056(n)} (-1)^(k-1)*A196020(n,k). - conjectured by Omar E. Pol, Feb 02 2013, and proved by Max Alekseyev, Nov 17 2013
a(n) = Sum_{k=1..A003056(n)} (-1)^(k-1)*A000330(k)*A000716(n-A000217(k)). - Mircea Merca, Mar 05 2014
a(n) = A240698(n, A000005(n)). - Reinhard Zumkeller, Apr 10 2014
a(n) = Sum_{d^2|n} A001615(n/d^2) = Sum_{d^3|n} A254981(n/d^3). - Álvar Ibeas, Mar 06 2015
a(3*n) = A144613(n). a(3*n + 1) = A144614(n). a(3*n + 2) = A144615(n). - Michael Somos, Jul 19 2015
a(n) = Sum{i=1..n} Sum{j=1..i} cos((2*Pi*n*j)/i). - Michel Lagneau, Oct 14 2015
a(n) = A000593(n) + A146076(n). - Omar E. Pol, Apr 05 2016
a(n) = A065475(n) + A048050(n). - Omar E. Pol, Nov 28 2016
a(n) = (Pi^2*n/6)*Sum_{q>=1} c_q(n)/q^2, with the Ramanujan sums c_q(n) given in A054533 as a c_n(k) table. See the Hardy reference, p. 141, or Hardy-Wright, Theorem 293, p. 251. - Wolfdieter Lang, Jan 06 2017
G.f. also (1 - E_2(q))/24, with the g.f. E_2 of A006352. See e.g., Hardy, p. 166, eq. (10.5.5). - Wolfdieter Lang, Jan 31 2017
From Antti Karttunen, Nov 25 2017: (Start)
a(n) = A048250(n) + A162296(n).
a(n) = A092261(n) * A295294(n). [This can be further expanded, see comment in A291750.] (End)
a(n) = A000593(n) * A038712(n). - Ivan N. Ianakiev and Omar E. Pol, Nov 26 2017
a(n) = Sum_{q=1..n} c_q(n) * floor(n/q), where c_q(n) is the Ramanujan's sum function given in A054533. - Daniel Suteu, Jun 14 2018
a(n) = Sum_{k=1..n} gcd(n, k) / phi(n / gcd(n, k)), where phi(k) is the Euler totient function. - Daniel Suteu, Jun 21 2018
a(n) = (2^(1 + (A000005(n) - A001227(n))/(A000005(n) - A183063(n))) - 1)*A000593(n) = (2^(1 + (A183063(n)/A001227(n))) - 1)*A000593(n). - Omar E. Pol, Nov 03 2018
a(n) = Sum_{i=1..n} tau(gcd(n, i)). - Ridouane Oudra, Oct 15 2019
From Peter Bala, Jan 19 2021: (Start)
G.f.: A(x) = Sum_{n >= 1} x^(n^2)*(x^n + n*(1 - x^(2*n)))/(1 - x^n)^2 - differentiate equation 5 in Arndt w.r.t. x, and set x = 1.
A(x) = F(x) + G(x), where F(x) is the g.f. of A079667 and G(x) is the g.f. of A117004. (End)
a(n) = Sum_{k=1..n} tau(n/gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). - Richard L. Ollerton, May 07 2021
With the convention that a(n) = 0 for n <= 0 we have the recurrence a(n) = t(n) + Sum_{k >= 1} (-1)^(k+1)*(2*k + 1)*a(n - k*(k + 1)/2), where t(n) = (-1)^(m+1)*(2*m+1)*n/3 if n = m*(m + 1)/2, with m positive, is a triangular number else t(n) = 0. For example, n = 10 = (4*5)/2 is a triangular number, t(10) = -30, and so a(10) = -30 + 3*a(9) - 5*a(7) + 7*a(4) = -30 + 39 - 40 + 49 = 18. - Peter Bala, Apr 06 2022
Recurrence: a(p^x) = p*a(p^(x-1)) + 1, if p is prime and for any integer x. E.g., a(5^3) = 5*a(5^2) + 1 = 5*31 + 1 = 156. - Jules Beauchamp, Nov 11 2022
Sum_{n>=1} a(n)/exp(2*Pi*n) = 1/24 - 1/(8*Pi) = A319462. - Vaclav Kotesovec, May 07 2023
a(n) < (7n*A001221(n) + 10*n)/6 [Duncan, 1961] (see Duncan and Tattersall). - Stefano Spezia, Jul 13 2025

A000594 Ramanujan's tau function (or Ramanujan numbers, or tau numbers).

Original entry on oeis.org

1, -24, 252, -1472, 4830, -6048, -16744, 84480, -113643, -115920, 534612, -370944, -577738, 401856, 1217160, 987136, -6905934, 2727432, 10661420, -7109760, -4219488, -12830688, 18643272, 21288960, -25499225, 13865712, -73279080, 24647168

Offset: 1

N. J. A. Sloane

Coefficients of the cusp form of weight 12 for the full modular group.
It is conjectured that tau(n) is never zero (this has been verified for n < 816212624008487344127999, see the Derickx, van Hoeij, Zeng reference).
M. J. Hopkins mentions that the only known primes p for which tau(p) == 1 (mod p) are 11, 23 and 691, that it is an open problem to decide if there are infinitely many such p and that no others are known below 35000. Simon Plouffe has now searched up to tau(314747) and found no other examples. - N. J. A. Sloane, Mar 25 2007
Number 1 of the 74 eta-quotients listed in Table I of Martin (1996).
With Dedekind's eta function and the discriminant Delta one has eta(z)^24 = Delta(z)/(2*Pi)^12 = Sum_{m >= 1} tau(m)*q^m, with q = exp(2*Pi*i*z), and z in the complex upper half plane, where i is the imaginary unit. Delta is the eigenfunction of the Hecke operator T_n (n >= 1) with eigenvalue tau(n): T_n Delta = tau(n) Delta. From this the formula for tau(m)*tau(n) given below in the formula section follows. See, e.g., the Koecher-Krieg reference, Lemma and Satz, p. 212. Or the Apostol reference, eq. (3) on p. 114 and the first part of section 6.13 on p. 131. - Wolfdieter Lang, Jan 26 2016
For the functional equation satisfied by the Dirichlet series F(s), Re(s) > 7, of a(n) see the Hardy reference, p. 173, (10.9.4). It is (2*Pi)^(-s) * Gamma(s) * F(s) = (2*Pi)^(s-12) * Gamma(12-s) * F(12-s). This is attributed to J. R. Wilton, 1929, on p. 185. - Wolfdieter Lang, Feb 08 2017
Conjecture: |a(n)| with n > 1 can never be a perfect power. This has been verified for n up to 10^6. - Zhi-Wei Sun, Dec 18 2024
Conjecture: The numbers |a(n)| (n = 1,2,3,...) are distinct. This has been verified for the first 10^6 terms. - Zhi-Wei Sun, Dec 21 2024
Conjecture: |a(n)| > 2*n^4 for all n > 2. This has been verified for n = 3..10^6. - Zhi-Wei Sun, Dec 25 2024
Conjecture: a(m)^2 + a(n)^2 can never be a perfect power. This implies Lehmer's conjecture that a(n) is never zero. We have verified that there is no perfect power among a(m)^2 + a(n)^2 with m,n <= 1000 . - Zhi-Wei Sun, Dec 28 2024
Conjecture: The equation |a(m)a(n)| = x^k with m < n, k > 1 and x >= 0 has no solution. This has been verified for m < n <= 5000. - Zhi-Wei Sun, Dec 29 2024
For some conjectures motivated by additive combinatorics, one may consult the link to Question 485138 at MathOverflow. - Zhi-Wei Sun, Jan 25 2025

			G.f. = q - 24*q^2 + 252*q^3 - 1472*q^4 + 4830*q^5 - 6048*q^6 - 16744*q^7 + 84480*q^8 - 113643*q^9 + ...
35328 = (-24)*(-1472) = a(2)*a(4) = a(2*4) + 2^11*a(2*4/4) = 84480 + 2048*(-24) = 35328. See a comment on T_n Delta = tau(n) Delta above. - _Wolfdieter Lang_, Jan 21 2016

Tom M. Apostol, Modular functions and Dirichlet series in number theory, second Edition, Springer, 1990, pp. 114, 131.
Graham Everest, Alf van der Poorten, Igor Shparlinski, and Thomas Ward, Recurrence Sequences, Amer. Math. Soc., 2003; see esp. p. 255.
Hershel M. Farkas and Irwin Kra, Theta constants, Riemann surfaces and the modular group, AMS 2001; see p. 298.
Nathan J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 77, Eq. (32.2).
G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, lecture X, pp. 161-185.
Bruce Jordan and Blair Kelly (blair.kelly(AT)att.net), The vanishing of the Ramanujan tau function, preprint, 2001.
Max Koecher and Aloys Krieg, Elliptische Funktionen und Modulformen, 2. Auflage, Springer, 2007, pp. 210 - 212.
Yu. I. Manin, Mathematics and Physics, Birkhäuser, Boston, 1981.
Henry McKean and Victor Moll, Elliptic Curves, Camb. Univ. Press, 1999, p. 139.
M. Ram Murty, The Ramanujan tau-function, pp. 269-288 of G. E. Andrews et al., editors, Ramanujan Revisited. Academic Press, NY, 1988.
Srinivasa Ramanujan, On Certain Arithmetical Functions. Collected Papers of Srinivasa Ramanujan, p. 153, Ed. G. H. Hardy et al., AMS Chelsea 2000.
Srinivasa Ramanujan, On Certain Arithmetical Functions. Ramanujan's Papers, p. 196, Ed. B. J. Venkatachala et al., Prism Books, Bangalore 2000.
Jean-Pierre Serre, A course in Arithmetic, Springer-Verlag, 1973, see p. 98.
Joseph H. Silverman, Advanced Topics in the Arithmetic of Elliptic Curves, Springer, 1994, see p. 482.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
H. P. F. Swinnerton-Dyer, Congruence properties of tau(n), pp. 289-311 of G. E. Andrews et al., editors, Ramanujan Revisited. Academic Press, NY, 1988.
Don Zagier, Introduction to Modular Forms, Chapter 4 in M. Waldschmidt et al., editors, From Number Theory to Physics, Springer-Verlag, 1992.
Don Zagier, "Elliptic modular forms and their applications", in: The 1-2-3 of modular forms, Springer Berlin Heidelberg, 2008, pp. 1-103.

Simon Plouffe, Table of n, a(n) for n = 1..16090
Jennifer S. Balakrishnan, William Craig, and Ken Ono, Variations of Lehmer's Conjecture for Ramanujan's tau-function, arXiv:2005.10345 [math.NT], 2020.
Jennifer S. Balakrishnan, Ken Ono, and Wei-Lun Tsai, Even values of Ramanujan's tau-function, arXiv:2102.00111 [math.NT], 2021.
Bruce C. Berndt and Ken Ono, Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary.
Bruce C. Berndt and Ken Ono, Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary, Séminaire Lotharingien de Combinatoire, B42c (1999), 63 pp.
Bruce C. Berndt and Pieter Moree, Sums of two squares and the tau-function: Ramanujan's trail, arXiv:2409.03428 [math.NT], 2024.
Matthew Boylan, Exceptional congruences for the coefficients of certain eta-product newforms, J. Number Theory, Vol. 98, No. 2 (2003), 377-389. MR1955423 (2003k:11071).
François Brunault, La fonction Tau de Ramanujan. [Wayback Machine link]
Denis Xavier Charles, Computing The Ramanujan Tau Function.
Benoit Cloitre, On the fractal behavior of primes, 2011.
John Cremona, Home page.
Maarten Derickx, Mark van Hoeij, and Jinxiang Zeng, Computing Galois representations and equations for modular curves X_H(l), arXiv:1312.6819 [math.NT], 2013-2014.
Bas Edixhoven, Jean-Marc Couveignes, Robin de Jong, Franz Merkl, and Johan Bosman, Computing the coefficients of a modular form, arXiv:math/0605244 [math.NT], 2006-2010.
John A. Ewell, Ramanujan's Tau Function, Proc. Amer. Math. Soc. 128 (2000), 723-726.
John A. Ewell, Ramanujan's Tau Function.
Steven R. Finch, Modular forms on SL_2(Z), December 28, 2005. [Cached copy, with permission of the author]
Luis H. Gallardo, On some formulae for Ramanujan's tau function, Rev. Colomb. Matem. 44 (2010) 103-112.
M. Z. Garaev, V. C. Garcia, and S. V. Konyagin, Waring problem with the Ramanujan tau function, Izvestiya: Mathematics, Vol. 72, No 1 (2008), pp. 35-46; arXiv preprint, arXiv:math/0607169 [math.NT], 2006.
Frank Garvan and Michael J. Schlosser, Combinatorial interpretations of Ramanujan's tau function, Discrete Mathematics, Vol. 341, No. 10 (2018), pp. 2831-2840; arXiv preprint, arXiv:1606.08037 [math.CO], 2016.
Hansraj Gupta, The Vanishing of Ramanujan's Function(n), Current Science, 17 (1948), p. 180. [Wayback Machine link]
James Lee Hafner and Jeffrey Stopple, A Heat Kernel Associated to Ramanujan's Tau Function, The Ramanujan Journal, Vol. 4, No. 2 (2000), pp. 123-128.
Yang-Hui He and John McKay, Moonshine and the Meaning of Life, in: M. Bhargava et al., Finite Simple Groups: Thirty Years of the Atlas and Beyond, Contemporary Mathematics, Vol. 694, American Mathematical Society, 2017; arXiv preprint, arXiv:1408.2083 [math.NT], 2014.
Michael J. Hopkins, Algebraic topology and modular forms, Proc. Internat. Congress Math., Beijing 2002, Vol. I, pp. 291-317; arXiv preprint, arXiv:math/0212397 [math.AT], 2002.
Masanobu Kaneko and Don Zagier, Supersingular j-invariants, hypergeometric series and Atkin's orthogonal polynomials, pp. 97-126 of D. A. Buell and J. T. Teitelbaum, eds., Computational Perspectives on Number Theory, Amer. Math. Soc., 1998
Jon Keating and Brady Haran, The Key to the Riemann Hypothesis, Numberphile video (2016).
Jerry B. Keiper, Ramanujan's Tau-Dirichlet Series [Dead link?]
Martin Klazar, What is an answer? — remarks, results and problems on PIO formulas in combinatorial enumeration, part I, arXiv:1808.08449 [math.CO], 2018.
N. Laptyeva and V. K. Murty, Fourier coefficients of forms of CM-type, Indian Journal of Pure and Applied Mathematics, Volume 45, Issue 5 (October 2014), pp. 747-758.
D. H. Lehmer, The Vanishing of Ramanujan's Function tau(n), Duke Mathematical Journal, 14 (1947), pp. 429-433.
D. H. Lehmer, The Vanishing of Ramanujan's Function tau(n), Duke Mathematical Journal, 14 (1947), pp. 429-433. [Annotated scanned copy]
D. H. Lehmer, Tables of Ramanujan's function tau(n), Math. Comp., 24 (1970), 495-496.
LMFDB, Newform orbit 1.12.a.a
Florian Luca and Igor E. Shparlinski, Arithmetic properties of the Ramanujan function, Proceedings of the Indian Academy of Sciences-Mathematical Sciences, Vol. 116. No. 1 (2006), pp. 1-8; arXiv preprint, arXiv:math/0607591 [math.NT], 2006.
Nik Lygeros and Olivier Rozier, A new solution to the equation tau(rho) == 0 (mod p), J. Int. Seq. 13 (2010), Article 10.7.4.
Yves Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc., Vol. 348, No. 12 (1996), 4825-4856, see page 4852 Table I.
Yuri Matiyasevich, Computational rediscovery of Ramanujan's tau numbers, Integers (2018) 18A, Article #A14.
Keith Matthews, Computing Ramanujan's tau function.
Stephen C. Milne, New infinite families of exact sums of squares formulas, Jacobi elliptic functions, and Ramanujan's tau function, Proc. Nat. Acad. Sci. USA, 93 (1996) 15004-15008.
Stephen C. Milne, Infinite families of exact sums of squares formulas, Jacobi elliptic functions, continued fractions and Schur functions, Ramanujan J., 6 (2002), 7-149.
Louis J. Mordell, On Mr. Ramanujan's empirical expansions of modular functions, Proceedings of the Cambridge Philosophical Society 19 (1917), pp. 117-124.
Pieter Moree, On some claims in Ramanujan's 'unpublished' manuscript on the partition and tau functions, arXiv:math/0201265 [math.NT], 2002.
M. Ram Murty and V. Kumar Murty, The Ramanujan tau-function, in: The mathematical legacy of Srinivasa Ramanujan (Springer, 2012), p 11-23.
M. Ram Murty, V. Kumar Murty, and T. N. Shorey, Odd values of the Ramanujan tau-function, Bulletin de la S. M. F., tome 115 (1987), p. 391-395.
Douglas Niebur, A formula for Ramanujan's tau-function, Illinois Journal of Mathematics, vol.19, no.3, pp.448-449, (1975). - _Joerg Arndt_, Sep 06 2015
Oklahoma State Mathematics Department, Ramanujan tau L-Function. [broken link]
Jon Perry, Ramanujan's Tau Function. [Wayback Machine link]
Simon Plouffe, The first 225035 terms (432 MB) [Wayback Machine link]
Simon Plouffe, Conjectures of the OEIS, as of June 20, 2018.
Srinivasa Ramanujan, Collected Papers, Table of tau(n);n=1 to 30.
Jean-Pierre Serre, An interpretation of some congruences concerning Ramanujan's tau function, Séminaire Delange-Pisot-Poitou. Théorie des nombres, tome 9, no 1 (1967-1968), exp. no 14, pp. 1-17.
Jean-Pierre Serre, An interpretation of some congruences concerning Ramanujan's Tau function, 1997.
Jean-Pierre Serre, Sur la lacunarité des puissances de eta, Glasgow Math. Journal, 27 (1985), 203-221.
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
N. J. A. Sloane, My Favorite Integer Sequences, arXiv:math/0207175 [math.CO], 2002.
Michael Somos, Index to Yves Martin's list of 74 multiplicative eta-quotients and their A-numbers, 2016.
David A. Steffen, Les Coefficients de Fourier de la forme modulaire: La fonction de Ramanujan tau(n), 1998.
William A. Stein, Database.
Zhi-Wei Sun, Questions on the reciprocals of the values of the tau function, Question 484763 at MathOverflow, December 25, 2024.
Zhi-Wei Sun, Pythagorean triples and Ramanujan's tau function, Question 484936 at MathOverflow, December 28, 2024.
Zhi-Wei Sun, Additive combinatorics for Ramanujan's tau function, Question 485138 at MathOverflow, January 1, 2025.
H. P. F. Swinnerton-Dyer, On l-adic representations and congruences for coefficients of modular forms, pp. 1-55 of Modular Functions of One Variable III (Antwerp 1972), Lect. Notes Math., 350, 1973.
F. Van der Blij, The function tau (n) of S. Ramanujan (an expository lecture), Math. Student, Vol. 18, No. 3 (1950), pp. 83-99; entire issues 3 and 4.
Jan Vonk, Overconvergent modular forms and their explicit arithmetic, Bulletin of the American Mathematical Society 58.3 (2021): 313-356.
G. N. Watson, A table of Ramanujan's function tau(n), Proc. London Math. Soc., 51 (1950), 1-13.
Eric Weisstein's World of Mathematics, Tau Function.
Kenneth S. Williams, Historical remark on Ramanujan's tau function, Amer. Math. Monthly, 122 (2015), 30-35; author's copy.
Index entries for "core" sequences.
Index entries for expansions of Product_{k >= 1} (1-x^k)^m.
Index entries for sequences related to Chebyshev polynomials.

Cf. A076847 (tau(prime)), A278577 (prime powers), A037955, A027364, A037945, A037946, A037947, A008408 (Leech).
For a(n) mod N for various values of N see A046694, A098108, A126812-...
Cf. A006352, A099059, A099060, A262339, A292781.
For primes p such that tau(p) == -1 (mod 23) see A106867.
Cf. A010816, A004009. A013973.
Cf. A126832(n) = a(n) mod 5.

using Nemo
function DedekindEta(len, r)
    R, z = PolynomialRing(ZZ, "z")
    e = eta_qexp(r, len, z)
    [coeff(e, j) for j in 0:len - 1] end
RamanujanTauList(len) = DedekindEta(len, 24)
RamanujanTauList(28) |> println # Peter Luschny, Mar 09 2018

M12:=ModularForms(Gamma0(1),12); t1:=Basis(M12)[2]; PowerSeries(t1[1],100); Coefficients($1);

Basis( CuspForms( Gamma1(1), 12), 100)[1]; /* Michael Somos, May 27 2014 */

M := 50; t1 := series(x*mul((1-x^k)^24,k=1..M),x,M); A000594 := n-> coeff(t1,x,n);

CoefficientList[ Take[ Expand[ Product[ (1 - x^k)^24, {k, 1, 30} ]], 30], x] (* Or *)
(* first do *) Needs["NumberTheory`Ramanujan`"] (* then *) Table[ RamanujanTau[n], {n, 30}] (* Dean Hickerson, Jan 03 2003 *)
max = 28; g[k_] := -BernoulliB[k]/(2k) + Sum[ DivisorSigma[k - 1, n - 1]*q^(n - 1), {n, 2, max + 1}]; CoefficientList[ Series[ 8000*g[4]^3 - 147*g[6]^2, {q, 0, max}], q] // Rest (* Jean-François Alcover, Oct 10 2012, from modular forms *)
RamanujanTau[Range[40]] (* The function RamanujanTau is now part of Mathematica's core language so there is no longer any need to load NumberTheory`Ramanujan` before using it *) (* Harvey P. Dale, Oct 12 2012 *)
a[ n_] := SeriesCoefficient[ q QPochhammer[ q]^24, {q, 0, n}]; (* Michael Somos, May 27 2014 *)
a[ n_] := With[{t = Log[q] / (2 Pi I)}, SeriesCoefficient[ Series[ DedekindEta[t]^24, {q, 0, n}], {q, 0, n}]]; (* Michael Somos, May 27 2014 *)

{a(n) = if( n<1, 0, polcoeff( x * eta(x + x * O(x^n))^24, n))};

{a(n) = if( n<1, 0, polcoeff( x * (sum( i=1, (sqrtint( 8*n - 7) + 1) \ 2,(-1)^i * (2*i - 1) * x^((i^2 - i)/2), O(x^n)))^8, n))};

taup(p,e)={
    if(e==1,
        (65*sigma(p,11)+691*sigma(p,5)-691*252*sum(k=1,p-1,sigma(k,5)*sigma(p-k,5)))/756
    ,
        my(t=taup(p,1));
        sum(j=0,e\2,
            (-1)^j*binomial(e-j,e-2*j)*p^(11*j)*t^(e-2*j)
        )
    )
};
a(n)=my(f=factor(n));prod(i=1,#f[,1],taup(f[i,1],f[i,2]));
\\ Charles R Greathouse IV, Apr 22 2013

\\ compute terms individually (Douglas Niebur, Ill. J. Math., 19, 1975):
a(n) = n^4*sigma(n) - 24*sum(k=1, n-1, (35*k^4-52*k^3*n+18*k^2*n^2)*sigma(k)*sigma(n-k));
vector(33, n, a(n)) \\ Joerg Arndt, Sep 06 2015

a(n)=ramanujantau(n) \\ Charles R Greathouse IV, May 27 2016

from sympy import divisor_sigma
def A000594(n): return n**4*divisor_sigma(n)-24*((m:=n+1>>1)**2*(0 if n&1 else (m*(35*m - 52*n) + 18*n**2)*divisor_sigma(m)**2)+sum((i*(i*(i*(70*i - 140*n) + 90*n**2) - 20*n**3) + n**4)*divisor_sigma(i)*divisor_sigma(n-i) for i in range(1,m))) # Chai Wah Wu, Nov 08 2022

def s(n)
  s = 0
  (1..n).each{|i| s += i if n % i == 0}
  s
end
def A000594(n)
  ary = [1]
  a = [0] + (1..n - 1).map{|i| s(i)}
  (1..n - 1).each{|i| ary << (1..i).inject(0){|s, j| s - 24 * a[j] * ary[-j]} / i}
  ary
end
p A000594(100) # Seiichi Manyama, Mar 26 2017

def A000594(n)
  ary = [0, 1]
  (2..n).each{|i|
    s, t, u = 0, 1, 0
    (1..n).each{|j|
      t += 9 * j
      u += j
      break if i <= u
      s += (-1) ** (j % 2 + 1) * (2 * j + 1) * (i - t) * ary[-u]
    }
    ary << s / (i - 1)
  }
  ary[1..-1]
end
p A000594(100) # Seiichi Manyama, Nov 25 2017

CuspForms( Gamma1(1), 12, prec=100).0; # Michael Somos, May 28 2013

list(delta_qexp(100))[1:] # faster Peter Luschny, May 16 2016

G.f.: x * Product_{k>=1} (1 - x^k)^24 = x*A(x)^8, with the g.f. of A010816.
G.f. is a period 1 Fourier series which satisfies f(-1 / t) = (t/i)^12 f(t) where q = exp(2 Pi i t). - Michael Somos, Jul 04 2011
abs(a(n)) = O(n^(11/2 + epsilon)), abs(a(p)) <= 2 p^(11/2) if p is prime. These were conjectured by Ramanujan and proved by Deligne.
Zagier says: The proof of these formulas, if written out from scratch, has been estimated at 2000 pages; in his book Manin cites this as a probable record for the ratio: "length of proof:length of statement" in the whole of mathematics.
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u*w * (u + 48*v + 4096*w) - v^3. - Michael Somos, Jul 19 2004
G.f. A(q) satisfies q * d log(A(q))/dq = A006352(q). - Michael Somos, Dec 09 2013
a(2*n) = A099060(n). a(2*n + 1) = A099059(n). - Michael Somos, Apr 17 2015
a(n) = tau(n) (with tau(0) = 0): tau(m)*tau(n) = Sum_{d| gcd(m,n)} d^11*tau(m*n/d^2), for positive integers m and n. If gcd(m,n) = 1 this gives the multiplicativity of tau. See a comment above with the Koecher-Krieg reference, p. 212, eq. (5). - Wolfdieter Lang, Jan 21 2016
Dirichlet series as product: Sum_{n >= 1} a(n)/n^s = Product_{n >= 1} 1/(1 - a(prime(n))/prime(n)^s  + prime(n)^(11-2*s)). See the Mordell link, eq. (2). - Wolfdieter Lang, May 06 2016. See also Hardy, p. 164, eqs. (10.3.1) and (10.3.8). - Wolfdieter Lang, Jan 27 2017
a(n) is multiplicative with a(prime(n)^k) = sqrt(prime(n)^(11))^k*S(k, a(n) / sqrt(prime(n)^(11))), with the Chebyshev S polynomials (A049310), for n >= 1 and k >= 2, and A076847(n) = a(prime(n)). See A076847 for alpha multiplicativity and examples. - Wolfdieter Lang, May 17 2016. See also Hardy, p. 164, eq. (10.3.6) rewritten in terms of S. - Wolfdieter Lang, Jan 27 2017
G.f. eta(z)^24 (with q = exp(2*Pi*i*z)) also (E_4(q)^3 - E_6(q)^2) / 1728. See the Hardy reference, p. 166, eq. (10.5.3), with Q = E_4 and R = E_6, given in A004009 and A013973, respectively. - Wolfdieter Lang, Jan 30 2017
a(n) (mod 5) == A126832(n).
a(1) = 1, a(n) = -(24/(n-1))*Sum_{k=1..n-1} A000203(k)*a(n-k) for n > 1. - Seiichi Manyama, Mar 26 2017
G.f.: x*exp(-24*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
Euler Transform of [-24, -24, -24, -24, ...]. - Simon Plouffe, Jun 21 2018
a(n) = n^4*sigma(n)-24*Sum_{k=1..n-1} (35*k^4-52*k^3*n+18*k^2*n^2)*sigma(k)*sigma(n-k). [See Douglas Niebur link]. - Wesley Ivan Hurt, Jul 22 2025

A004009 Expansion of Eisenstein series E_4(q) (alternate convention E_2(q)); theta series of E_8 lattice.

Original entry on oeis.org

1, 240, 2160, 6720, 17520, 30240, 60480, 82560, 140400, 181680, 272160, 319680, 490560, 527520, 743040, 846720, 1123440, 1179360, 1635120, 1646400, 2207520, 2311680, 2877120, 2920320, 3931200, 3780240, 4747680, 4905600, 6026880

Offset: 0

N. J. A. Sloane

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
E_8 is also the Barnes-Wall lattice in 8 dimensions.
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).
Ramanujan Lambert series: P(q) (see A006352), Q(q) (A004009), R(q) (A013973).
The E_8 lattice is integral, unimodular, and even. The 240 shortest nonzero vectors in the lattice have norm squared 2. Of these vectors, 128 are all half-integer, and 112 are all integer. - Michael Somos, Jun 10 2019

			G.f. = 1 + 240*x + 2160*x^2 + 6720*x^3 + 17520*x^4 + 30240*x^5 + 60480*x^6 + ...
G.f. = 1 + 240*q^2 + 2160*q^4 + 6720*q^6 + 17520*q^8 + 30240*q^10 + 60480*q^12 + ...

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 123.
W. Ebeling, Lattices and Codes, Vieweg; 2nd ed., 2002, see p. 53.
R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.
S. Ramanujan, On Certain Arithmetical Functions, Messenger Math., 45 (1916), 11-15 (Eq. (25)). Collected Papers of Srinivasa Ramanujan, Chap. 16, Ed. G. H. Hardy et al., Chelsea, NY, 1962.
S. Ramanujan, On Certain Arithmetical Functions, Messenger Math., 45 (1916), 11-15 (Eq. (25)). Ramanujan's Papers, p. 196, Ed. B. J. Venkatachala et al., Prism Books, Bangalore 2000.
Jean-Pierre Serre, "A Course in Arithmetic", Springer, 1978
Joseph H. Silverman, "Advanced Topics in the Arithmetic of Elliptic Curves", Springer, 1994
N. J. A. Sloane, Seven Staggering Sequences, in Homage to a Pied Puzzler, E. Pegg Jr., A. H. Schoen and T. Rodgers (editors), A. K. Peters, Wellesley, MA, 2009, pp. 93-110.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from N. J. A. Sloane)
D. Bump, Automorphic Forms and Representations, Cambr. Univ. Press, 1997, p. 29.
H. H. Chan and C. Krattenthaler, Recent progress in the study of representations of integers as sums of squares, arXiv:math/0407061 [math.NT], 2004.
Heng Huat Chan, Shaun Cooper, and Pee Choon Toh, Ramanujan's Eisenstein series and powers of Dedekind's eta-function, Journal of the London Mathematical Society 75.1 (2007): 225-242. See Q(q).
Henry Cohn and Stephen D. Miller, Some properties of optimal functions for sphere packing in dimensions 8 and 24, arXiv:1603.04759 [math.MG], 2016.
H. S. M. Coxeter, Integral Cayley numbers, Duke Math. J. 13 (1946), 561-578; reprinted in "Twelve Geometric Essays", pp. 20-39.
D. de Laat and F. Vallentin, A Breakthrough in Sphere Packing: The Search for Magic Functions, arXiv preprint arXiv:1607.02111 [math.MG], 2016.
Yang-Hui He and John McKay, Sporadic and Exceptional, arXiv:1505.06742 [math.AG], 2015.
N. Heninger, E. M. Rains and N. J. A. Sloane, On the Integrality of n-th Roots of Generating Functions, arXiv:math/0509316 [math.NT], 2005-2006; J. Combinatorial Theory, Series A, 113 (2006), 1732-1745.
M. Kaneko and D. Zagier, Supersingular j-invariants, hypergeometric series and Atkin's orthogonal polynomials, pp. 97-126 of D. A. Buell and J. T. Teitelbaum, eds., Computational Perspectives on Number Theory, Amer. Math. Soc., 1998
Masao Koike, Modular forms on non-compact arithmetic triangle groups, Unpublished manuscript [Extensively annotated with OEIS A-numbers by N. J. A. Sloane, Feb 14 2021. I wrote 2005 on the first page but the internal evidence suggests 1997.]
Robert V. Moody and Jiri Patera, Fast recursion formula for weight multiplicities, Bulletin of the American Mathematical Society 7.1 (1982): 237-242.
G. Nebe and N. J. A. Sloane, Home page for E_8 lattice
H. Ochiai, Counting functions for branched covers of elliptic curves and quasi-modular forms, arXiv:math-ph/9909023, 1999.
S. Ramanujan, On the coefficients in the expansions of certain modular functions, Proc. Royal Soc., A, 95 (1918), 144-155.
Michael Somos, Introduction to Ramanujan theta functions
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
N. J. A. Sloane, Seven Staggering Sequences.
Maryna S. Viazovska, The sphere packing problem in dimension 8, arXiv preprint arXiv:1603.04246 [math.NT], 2016.
Martin H. Weissman, Octonions, Cubes, Embeddings, March 2, 2009.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions
Eric Weisstein's World of Mathematics, Eisenstein Series.
Eric Weisstein's World of Mathematics, Leech Lattice.
Eric Weisstein's World of Mathematics, Barnes-Wall Lattice
Wikipedia, Eisenstein series
Wikipedia, E_8 lattice
Index entries for sequences related to Eisenstein series
Index entries for sequences related to Barnes-Wall lattices

Cf. A046948 (partial sums), A000143, A108091 (eighth root).
Cf. A008410, A008411, A001158.
Cf. A006352 (E_2), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).
Cf. A007331 (theta_2(q)^8 / 256), A000143 (theta_3(q)^8), A035016 (theta_4(q)^8).

Basis( ModularForms( Gamma1(1), 4), 29) [1]; /* Michael Somos, May 11 2015 */

L := Lattice("E",8); A := ThetaSeries(L, 57); A; /* Michael Somos, Jun 10 2019 */

with(numtheory); E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(4);

a[ n_] := If[ n < 1, Boole[n == 0], 240 DivisorSigma[ 3, n]]; (* Michael Somos, Jul 11 2011 *)
a[ n_] := SeriesCoefficient[ With[ {t2 = EllipticTheta[ 2, 0, q]^4, t3 = EllipticTheta[ 3, 0, q]^4}, t2^2 + 14 t2 t3 + t3^2], {q, 0, n}]; (* Michael Somos, Jun 04 2014 *)
max = 30; s = 1 + 240*Sum[k^3*(q^k/(1 - q^k)), {k, 1, max}] + O[q]^max; CoefficientList[s, q] (* Jean-François Alcover, Nov 27 2015, after Gene Ward Smith *)
a[ n_] := SeriesCoefficient[ With[ {t2 = EllipticTheta[ 2, 0, q]^4, t3 = EllipticTheta[ 3, 0, q]^4}, t2^2 - t2 t3 + t3^2], {q, 0, 2 n}]; (* Michael Somos, Jul 31 2016 *)

{a(n) = if( n<1, n==0, 240 * sigma(n, 3))};

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x + A)^24 + 256 * x * eta(x^2 + A)^24) / (eta(x + A) * eta(x^2 + A))^8, n))}; /* Michael Somos, Dec 30 2008 */

q='q+O('q^50); Vec((eta(q)^24+256*q*eta(q^2)^24)/(eta(q)*eta(q^2))^8) \\ Altug Alkan, Sep 30 2018

from sympy import divisor_sigma
def a(n): return 1 if n == 0 else 240 * divisor_sigma(n, 3)
[a(n) for n in range(51)]  # Indranil Ghosh, Jul 15 2017

ModularForms(Gamma1(1), 4, prec=30).0 ; # Michael Somos, Jun 04 2013

Can also be expressed as E4(q) = 1 + 240*Sum_{i >= 1} i^3 q^i/(1 - q^i) - Gene Ward Smith, Aug 22 2006
Theta series of E_8 lattice = 1 + 240 * Sum_{m >= 1} sigma_3(m) * q^(2*m), where sigma_3(m) is the sum of the cubes of the divisors of m (A001158).
Expansion of (phi(-q)^8 - (2 * phi(-q) * phi(q))^4 + 16 * phi(q)^8) in powers of q where phi() is a Ramanujan theta function.
Expansion of (eta(q)^24 + 256 * eta(q^2)^24) / (eta(q) * eta(q^2))^8 in powers of q. - Michael Somos, Dec 30 2008
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u^2 + 33*v^2 + 256*w^2 - 18*u*v + 16*u*w - 288*v*w . - Michael Somos, Jan 05 2006
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u1^2 + 16*u2^2 + 81*u3^2 + 1296*u6^2 - 14*u1*u2 - 18*u1*u3 + 30*u1*u6 + 30*u2*u3 - 288*u2*u6 - 1134*u3*u6 . - Michael Somos, Apr 15 2007
G.f. A(x) satisfies 0 = f(A(x), A(x^3), A(x^9)) where f(u, v, w) = u^3*v + 9*w*u^3 - 84*u^2*v^2 + 246*u*v^3 - 253*v^4 - 675*w*u^2*v + 729*w^2*u^2 - 4590*w*u*v^2 + 19926*w*v^3 - 54675*w^2*u*v + 59049*w^3*u + 531441*w^3*v - 551124*w^2*v^2 . - Michael Somos, Apr 15 2007
G.f. is a period 1 Fourier series which satisfies f(-1 / t) = (t/i)^4 * f(t) where q = exp(2 Pi i t). - Michael Somos, Dec 30 2008
Convolution square is A008410. A008411 is convolution of this sequence with A008410.
Expansion of Ramanujan's function Q(q^2) = 12 (omega/Pi)^4 g2 (Weierstrass invariant) in powers of q^2.
Expansion of a(q) * (a(q)^3 + 8*c(q)^3) in powers of q where a(), c() are cubic AGM theta functions. - Michael Somos, Jan 14 2015
G.f. is (theta_2(q)^8 + theta_3(q)^8 + theta_4(q)^8) / 2 where q = exp(Pi i t). So a(n) = A008430(n) + 128*A007331(n) (= A000143(2*n) + 128*A007331(n) = A035016(2*n) + 128*A007331(n)). - Seiichi Manyama, Sep 30 2018
a(n) = 240*A001158(n) if n>0. - Michael Somos, Oct 01 2018
Sum_{k=1..n} a(k) ~ 2 * Pi^4 * n^4 / 3. - Vaclav Kotesovec, Jan 14 2024

A013973 Expansion of Eisenstein series E_6(q) (alternate convention E_3(q)).

Original entry on oeis.org

1, -504, -16632, -122976, -532728, -1575504, -4058208, -8471232, -17047800, -29883672, -51991632, -81170208, -129985632, -187132176, -279550656, -384422976, -545530104, -715608432, -986161176, -1247954400, -1665307728, -2066980608, -2678616864, -3243917376, -4159663200

Offset: 0

N. J. A. Sloane

Ramanujan Lambert series: P(q) (see A006352), Q(q) (A004009), R(q) (A013973).

			G.f. = 1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + ...

W. Ebeling, Lattices and Codes, Vieweg; 2nd ed., 2002, see p. 53.
R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
M. Kaneko and D. Zagier, Supersingular j-invariants, hypergeometric series and Atkin's orthogonal polynomials, pp. 97-126 of D. A. Buell and J. T. Teitelbaum, eds., Computational Perspectives on Number Theory, Amer. Math. Soc., 1998.
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.
Jean-Pierre Serre, "A Course in Arithmetic", Springer, 1978
Joseph H. Silverman, "Advanced Topics in the Arithmetic of Elliptic Curves", Springer, 1994

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from T. D. Noe)
R. E. Borcherds, Automorphic forms on O_{s+2,2}(R)^{+} and generalized Kac-Moody algebras, pp. 744-752 of Proc. Intern. Congr. Math., Vol. 2, 1994.
D. Bump, Automorphic Forms and Representations, Cambr. Univ. Press, 1997, p. 29.
Heng Huat Chan, Shaun Cooper, and Pee Choon Toh, Ramanujan's Eisenstein series and powers of Dedekind's eta-function, Journal of the London Mathematical Society 75.1 (2007): 225-242. See R(q).
Masao Koike, Modular forms on non-compact arithmetic triangle groups, Unpublished manuscript [Extensively annotated with OEIS A-numbers by N. J. A. Sloane, Feb 14 2021. I wrote 2005 on the first page but the internal evidence suggests 1997.]
H. Ochiai, Counting functions for branched covers of elliptic curves and quasi-modular forms, arXiv:math-ph/9909023, 1999.
Eric Weisstein's World of Mathematics, Eisenstein Series.
Index entries for sequences related to Eisenstein series

Cf. A004009, A008410, A013974, A145095.
Cf. A006352 (E_2), A004009 (E_4), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).
Cf. A001160, A286346 (eta(q)^24 / eta(q^2)^12), A286399 (eta(q^2)^12 * eta(q^4)^8 / eta(q)^8).

Basis( ModularForms( Gamma1(1), 6), 25); /* Michael Somos, Apr 01 2015 */

E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(6);
# alternative
A013973 := proc(n)
    if n = 0 then
        1;
    else
        -504*numtheory[sigma][5](n) ;
    end if;
end proc:
seq(A013973(n),n=0..10) ; # R. J. Mathar, Feb 22 2021

a[ n_] := If[ n < 1, Boole[n == 0], -504 DivisorSigma[ 5, n]]; (* Michael Somos, Apr 21 2013 *)
a[ n_] := SeriesCoefficient[ With[ {t2 = EllipticTheta[ 2, 0, q]^4, t3 = EllipticTheta[ 3, 0, q]^4}, t2^3 - 33 (t2 + t3) t2 t3 + t3^3], {q, 0, n}]; (* Michael Somos, Apr 21 2013 *)
a[ n_] := SeriesCoefficient[ With[ {t3 = EllipticTheta[ 3, 0, q]^4, t4 = EllipticTheta[ 4, 0, q]^4}, (t3^3 - 3 (t3 - t4)^2 (t3 + t4) + t4^3) / 2], {q, 0, 2 n}]; (* Michael Somos, Jun 04 2014 *)
a[ n_] := SeriesCoefficient[ With[ {e1 = QPochhammer[ q]^8, e4 = 32 q QPochhammer[ q^4]^8}, (e1 + e4) (e1^2 - 16 e1 e4 - 8 e4^2) / QPochhammer[ q^2]^12], {q, 0, n}]; (* Michael Somos, Apr 01 2015 *)
a[ n_] := SeriesCoefficient[ With[ {t2 = EllipticTheta[ 2, 0, q]^4, t3 = EllipticTheta[ 3, 0, q]^4}, t2^3 - 3/2 (t2 + t3) t2 t3 + t3^3], {q, 0, 2 n}]; (* Michael Somos, Jul 31 2016 *)
terms = 25; E6[x_] = 1-(12/BernoulliB[6])*Sum[k^5*x^k/(1-x^k), {k, terms}]; CoefficientList[E6[x] + O[x]^terms, x] (* Jean-François Alcover, Feb 28 2018 *)

{a(n) = if( n<1, n==0, -504 * sigma( n, 5))};

{a(n) = my(A, A1, A4); if( n<0, 0, A = x * O(x^n); A1 = eta(x + A)^8; A4 = 32 * x * eta(x^4 + A)^8; polcoeff( (A1 + A4) * (A1^2 - 16 * A1 * A4 - 8 * A4^2) / eta(x^2 + A)^12, n))}; /* Michael Somos, Dec 30 2008 */

ModularForms( Gamma1(1), 6, prec=25).0; # Michael Somos, Jun 04 2013

E6(q) = 1 - 504*Sum_{i>=1} sigma_5(i)q^i where sigma_5(n) is A001160, the sum of fifth powers of the divisors of n. It can also be expressed as E6(q) = 1 - 504*Sum_{i>=1} i^5*q^i/(1-q^i). - Gene Ward Smith, Aug 22 2006
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u^2*v - 8*u^2*w - 66*u*v^2 + 592*u*v*w - 512*u*w^2 + 121*v^3 - 4224*v^2*w + 4096*v*w^2. - Michael Somos, Apr 10 2005
Expansion of Ramanujan's function R(q) = 216*g3 (Weierstrass invariant).
Expansion of (eta(q)^8 + 32 * eta(q^4)^8) * (eta(q)^16 - 512 * eta(q)^8 * eta(q^4)^8 - 8192 * eta(q^4)^16) / eta(q^2)^12 in powers of q. - Michael Somos, Dec 30 2008
G.f. is a period 1 Fourier series which satisfies f(-1 / t) = - (t/i)^6 * f(t) where q = exp(2 Pi i t). - Michael Somos, Dec 30 2008
E6(q) = eta(q)^24 / eta(q^2)^12 - 480 * eta(q^2)^12 - 16896 * eta(q^2)^12 * eta(q^4)^8 / eta(q)^8 + 8192 * eta(q^4)^24 / eta(q^2)^12. - Seiichi Manyama, May 08 2017

A064987 a(n) = n*sigma(n).

Original entry on oeis.org

1, 6, 12, 28, 30, 72, 56, 120, 117, 180, 132, 336, 182, 336, 360, 496, 306, 702, 380, 840, 672, 792, 552, 1440, 775, 1092, 1080, 1568, 870, 2160, 992, 2016, 1584, 1836, 1680, 3276, 1406, 2280, 2184, 3600, 1722, 4032, 1892, 3696, 3510, 3312, 2256, 5952

Offset: 1

Vladeta Jovovic, Oct 30 2001

Dirichlet convolution of sigma_2(n)=A001157(n) with phi(n)=A000010(n). - Vladeta Jovovic, Oct 27 2002
Equals row sums of triangle A143311 and of triangle A143308. - Gary W. Adamson, Aug 06 2008
a(n) is also the sum of all n's present in A244580, or in other words, a(n) is also the volume (or number of cubes) below the terraces of the n-th level of the staircase described in A244580 (see also A237593). - Omar E. Pol, Oct 11 2018
If n is a superperfect number then sigma(n) is a Mersenne prime and a(n) is a perfect number, a(A019279(k)) = A000396(k), k >= 1, assuming there are no odd perfect numbers. - Omar E. Pol, Apr 15 2020

B. C. Berndt, Ramanujan's theory of theta-functions, Theta functions: from the classical to the modern, Amer. Math. Soc., Providence, RI, 1993, pp. 1-63. MR 94m:11054. see page 43.
G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, pp. 166-167.

Harry J. Smith, Table of n, a(n) for n = 1..1000
Joerg Arndt, On computing the generalized Lambert series, arXiv:1202.6525v3 [math.CA], (2012).
Passawan Noppakaew and Prapanpong Pongsriiam, Product of Some Polynomials and Arithmetic Functions, J. Int. Seq. (2023) Vol. 26, Art. 23.9.1.
Michel Planat, Twelve-dimensional Pauli group contextuality with eleven rays, arXiv:1201.5455 [quant-ph], 2012.

Main diagonal of A319073.

Cf. A000203, A038040, A002618, A000010, A001157, A143308, A143311, A004009, A006352, A000594, A126832, A069097 (Mobius transform), A001001 (inverse Mobius transform), A237593, A244580.

a:=List([1..50],n->n*Sigma(n));; Print(a); # Muniru A Asiru, Jan 01 2019

a064987 n = a000203 n * n  -- Reinhard Zumkeller, Jan 21 2014

[n*SumOfDivisors(n): n in [1..70]]; // Vincenzo Librandi, Jan 01 2019

with(numtheory): [n*sigma(n)$n=1..50]; # Muniru A Asiru, Jan 01 2019

# DivisorSigma[1,#]&/@Range[80]  (* Harvey P. Dale, Mar 12 2011 *)

numlib::sigma(n)*n$ n=1..81 // Zerinvary Lajos, May 13 2008

PARI
```
{a(n) = if ( n==0, 0, n * sigma(n))}
```

{ for (n=1, 1000, write("b064987.txt", n, " ", n*sigma(n)) ) } \\ Harry J. Smith, Oct 02 2009

Multiplicative with a(p^e) = p^e * (p^(e+1) - 1) / (p - 1).
G.f.: Sum_{n>0} n^2*x^n/(1-x^n)^2. - Vladeta Jovovic, Oct 27 2002
G.f.: phi_{2, 1}(x) where phi_{r, s}(x) = Sum_{n, m>0} m^r * n^s * x^{m*n}. - Michael Somos, Apr 02 2003
G.f. is also (Q - P^2) / 288 where P, Q are Ramanujan Lambert series. - Michael Somos, Apr 02 2003. See the Hardy reference, p. 136, eq. (10.5.4) (with a proof). For Q and P, (10.5.6) and (10.5.5), see E_4 A004009 and E_2 A006352, respectively. - Wolfdieter Lang, Jan 30 2017
Convolution of A000118 and A186690. Dirichlet convolution of A000027 and A000290. - Michael Somos, Mar 25 2012
Dirichlet g.f.: zeta(s-1)*zeta(s-2). - R. J. Mathar, Feb 16 2011
a(n) = A009194(n)*A009242(n). - Michel Marcus, Oct 23 2013
a(n) (mod 5) = A126832(n) = A000594(n) (mod 5). See A126832 for references. - Wolfdieter Lang, Feb 03 2017
L.g.f.: Sum_{k>=1} k*x^k/(1 - x^k) = Sum_{n>=1} a(n)*x^n/n. - Ilya Gutkovskiy, May 13 2017
Sum_{k>=1} 1/a(k) = 1.4383899259334187832765458631783591251241657856627653748389234270650138768... - Vaclav Kotesovec, Sep 20 2020
From Peter Bala, Jan 21 2021: (Start)
G.f.: Sum_{n >= 1} n*q^n*(1 + q^n)/(1 - q^n)^3 (use the expansion x*(1 + x)/(1 - x)^3 = x + 2^2*x^2 + 3^2*x^3 + 4^2*x^4 + ...).
A faster converging g.f.: Sum_{n >= 1} q^(n^2)*( n^3*q^(3*n) - (n^3 + 3*n^2 - n)*q^(2*n) - (n^3 - 3*n^2 - n)*q^n + n^3 )/(1 - q^n)^3 - differentiate equation 5 in Arndt w.r.t. both x and q and then set x = 1. (End)
From Richard L. Ollerton, May 07 2021: (Start)
a(n) = Sum_{k=1..n} sigma_2(gcd(n,k)).
a(n) = Sum_{k=1..n} sigma_2(n/gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). (End)
From Peter Bala, Jan 22 2024: (Start)
a(n) = Sum_{1 <= j, k <= n} sigma_1( gcd(j, k, n) ).
a(n) = Sum_{d divides n} sigma_1(d)*J_2(n/d) = Sum_{d divides n} sigma_2(d)* phi(n/d), where the Jordan totient function J_2(n) = A007434(n). (End)

A008410 a(0) = 1, a(n) = 480*sigma_7(n).

Original entry on oeis.org

1, 480, 61920, 1050240, 7926240, 37500480, 135480960, 395301120, 1014559200, 2296875360, 4837561920, 9353842560, 17342613120, 30119288640, 50993844480, 82051050240, 129863578080, 196962563520

Offset: 0

N. J. A. Sloane

nonn

Eisenstein series E_8(q) (alternate convention E_4(q)); theta series of direct sum of 2 copies of E_8 lattice.

			G.f. = 1 + 480*q + 61920*q^2 + 1050240*q^3 + 7926240*q^4 + 37500480*q^5 + ...

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 123.
R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.
S. Ramanujan, On Certain Arithmetical Functions, Messenger Math., 45 (1916), 11-15 (Eq. (25)). Collected Papers of Srinivasa Ramanujan, Chap. 16, Ed. G. H. Hardy et al., Chelsea, NY, 1962.
S. Ramanujan, On Certain Arithmetical Functions, Messenger Math., 45 (1916), 11-15 (Eq. (25)). Ramanujan's Papers, p. 196, Ed. B. J. Venkatachala et al., Prism Books, Bangalore 2000.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
H. D. Nguyen, D. Taggart, Mining the OEIS: Ten Experimental Conjectures, 2013; Mentions this sequence. - From _N. J. A. Sloane_, Mar 16 2014
Eric Weisstein's World of Mathematics, Eisenstein Series.
Index entries for sequences related to Eisenstein series

Cf. A013973.
Cf. A006352 (E_2), A004009 (E_4), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).
Convolution square of A004009.

Basis( ModularForms( Gamma1(1), 8), 33) [1]; /* Michael Somos, May 27 2014 */

E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(8);

a[ n_] := If[ n < 1, Boole[n == 0], 480 DivisorSigma[ 7, n]]; (* Michael Somos, Jun 04 2013 *)
nmax = 60; CoefficientList[Series[(Product[(1-x^k)^8 / (1+x^k)^8, {k, 1, nmax}] + 256 * x * Product[(1+x^k)^16 *(1-x^k)^8, {k, 1, nmax}])^2, {x, 0, nmax}], x] (* Vaclav Kotesovec, Jul 02 2017 *)

{a(n) = if( n<1, n==0, 480 * sigma(n, 7))};

{a(n) = local(A, e1, e2, e4); if( n<0, 0, n*=2; A = x * O(x^n); e1 = eta(x + A)^16; e2 = eta(x^2 + A)^16; e4 = eta(x^4 + A)^16; polcoeff( (e1*e2^3 + 256*x^2 * e4*(e2^3 + e1^2*e4)) / (e1*e2*e4), n))}; /* Michael Somos, Jun 29 2005 */

{a(n) = local(A); if( n<0, 0, A = x * O(x^n); polcoeff( ((eta(x + A)^24 + 256 * x * eta(x^2 + A)^24) / (eta(x + A) * eta(x^2 + A))^8)^2, n))}; /* Michael Somos, Dec 30 2008 */

ModularForms( Gamma1(1), 8, prec=33).0; # Michael Somos, Jun 04 2013

Equivalently, g.f. = (theta2^16+theta3^16+theta4^16)/2.
G.f. Sum{k>=0} a(k)q^(2k) = (theta2^16+theta3^16+theta4^16)/2.
Expansion of ((eta(q)^24 + 256 * eta(q^2)^24) / (eta(q) * eta(q^2))^8)^2 in powers of q. - Michael Somos, Dec 30 2008
G.f. is a period 1 Fourier series which satisfies f(-1 / t) = (t/i)^8 * f(t) where q = exp(2 Pi i t). - Michael Somos, Dec 30 2008
a(n) = 480*A013955(n). - R. J. Mathar, Oct 10 2012

A013974 Eisenstein series E_10(q) (alternate convention E_5(q)).

Original entry on oeis.org

1, -264, -135432, -5196576, -69341448, -515625264, -2665843488, -10653352512, -35502821640, -102284205672, -264515760432, -622498190688, -1364917062432, -2799587834736, -5465169838656, -10149567696576, -18177444679944

Offset: 0

N. J. A. Sloane

sign

			G.f. = 1 - 264*q - 135432*q^2 - 5196576*q^3 - 69341448*q^4 - 515625264*q^5 + ...

R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.

T. D. Noe, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Eisenstein Series.
Index entries for sequences related to Eisenstein series

Cf. A008410.
Cf. A006352 (E_2), A004009 (E_4), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).
Convolution of A004009 and A013973.

E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(10);

a[ n_] := If[ n < 1, Boole[n == 0], -264 DivisorSigma[ 9, n]]; (* Michael Somos, Jun 04 2013 *)
a[ n_] := SeriesCoefficient[ With[{t2 = EllipticTheta[ 2, 0, q]^4, t3 = EllipticTheta[ 3, 0, q]^4}, t2^5 - 19 t2 t3 (t2^3 + t3^3) - 494 (t2 t3)^2 (t2 + t3) + t3^5], {q, 0, n}]; (* Michael Somos, Jun 04 2013 *)
terms = 17; Ei[n_] = 1-(2n/BernoulliB[n]) Sum[k^(n-1) x^k/(1-x^k), {k, terms}]; CoefficientList[Ei[10] + O[x]^terms, x] (* Jean-François Alcover, Mar 01 2018 *)

{a(n) = if( n<1, n==0, -264 * sigma( n, 9))};

ModularForms( Gamma1(1), 10, prec=13).0; # Michael Somos, Jun 04 2013

Sum_{n >= 0} a(n)/exp(Pi)^(2n) = 0 or is very close to 0. - Gerald McGarvey, Jan 25 2005
G.f. is a period 1 Fourier series which satisfies f(-1 / t) = - (t/i)^10 * f(t) where q = exp(2 Pi i t). - Michael Somos, Dec 30 2008
G.f.: 1 - 264*Sum_{k>=1} k^9*x^k/(1 - x^k). - Ilya Gutkovskiy, Aug 31 2017

A058550 Eisenstein series E_14(q) (alternate convention E_7(q)).

Original entry on oeis.org

1, -24, -196632, -38263776, -1610809368, -29296875024, -313495116768, -2325336249792, -13195750342680, -61004818143672, -240029297071632, -828545091454368, -2568152034827232, -7269002558214096, -19051479894545856, -46708710975763776

Offset: 0

N. J. A. Sloane, Dec 25 2000

sign

R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Index entries for sequences related to Eisenstein series

Cf. A006352 (E_2), A004009 (E_4), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).

E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(14);

terms = 16;
E14[x_] = 1 - 24*Sum[k^13*x^k/(1 - x^k), {k, 1, terms}];
E14[x] + O[x]^terms // CoefficientList[#, x]&
(* or: *)
Table[If[n == 0, 1, -24*DivisorSigma[13, n]], {n, 0, terms-1}] (* Jean-François Alcover, Feb 26 2018 *)
(* or *)
terms = 15; E4[x_] = 1 + 240*Sum[k^3*x^k/(1 - x^k), {k, 1, terms}]; E6[x_] = 1 - 504*Sum[k^5*x^k/(1 - x^k), {k, 1, terms}]; CoefficientList[Series[E4[x]^2*E6[x], {x, 0, terms}], x] (* Vaclav Kotesovec, Aug 03 2025 *)

PARI
```
a(n)=if(n<1,n==0,-24*sigma(n,13))
```

A029828 Eisenstein series E_12(q) (alternate convention E_6(q)), multiplied by 691.

Original entry on oeis.org

691, 65520, 134250480, 11606736960, 274945048560, 3199218815520, 23782204031040, 129554448266880, 563087459516400, 2056098632318640, 6555199353000480, 18693620658498240, 48705965462306880, 117422349017369760, 265457064498837120, 566735214731736960, 1153203117089652720

Offset: 0

N. J. A. Sloane

nonn

R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.
J.-P. Serre, Course in Arithmetic, Chap. VII, Section 4.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Index entries for sequences related to Eisenstein series

Cf. A037164.

Cf. A006352 (E_2), A004009 (E_4), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).

E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(12);

Table[If[n == 0, 691, 65520 DivisorSigma[11, n]], {n, 0, 16}] (* Jean-François Alcover, Feb 26 2018 *)

a(n)=if(n<1,691*(n==0),65520*sigma(n,11))

A004011 Theta series of D_4 lattice; Fourier coefficients of Eisenstein series E_{gamma,2}.

Original entry on oeis.org

1, 24, 24, 96, 24, 144, 96, 192, 24, 312, 144, 288, 96, 336, 192, 576, 24, 432, 312, 480, 144, 768, 288, 576, 96, 744, 336, 960, 192, 720, 576, 768, 24, 1152, 432, 1152, 312, 912, 480, 1344, 144, 1008, 768, 1056, 288, 1872, 576, 1152, 96, 1368, 744, 1728, 336

Offset: 0

N. J. A. Sloane

D_4 is also the Barnes-Wall lattice in 4 dimensions.
E_{gamma,2} is the unique normalized modular form for Gamma_0(2) of weight 2.
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).
Ramanujan's Eisenstein series: P(q) (see A006352), Q(q) (A004009), R(q) (A013973).
Convolution square is A008658. - Michael Somos, Aug 21 2014
Expansion of 2*P(x^2) - P(x) in powers of x where P() is a Ramanujan Eisenstein series. - Michael Somos, Feb 16 2015
a(n) is the number of Hurwitz quaternions of norm n. - Michael Somos, Feb 16 2015

			G.f. = 1 + 24*x + 24*x^2 + 96*x^3 + 24*x^4 + 144*x^5 + 96*x^6 + 192*x^7 + 24*x^8 + ...
G.f. = 1 + 24*q^2 + 24*q^4 + 96*q^6 + 24*q^8 + 144*q^10 + 96*q^12 + 192*q^14 + 24*q^16 + ...

Bruce C. Berndt, Ramanujan's Notebooks Part V, Springer-Verlag, 1998, see p. 148 Eq. (9.11).
Harvey Cohn, Advanced Number Theory, Dover Publications, Inc., 1980, p. 89. Eq. (1).
J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 119.
S. Ramanujan, Notebooks, Tata Institute of Fundamental Research, Bombay 1957 Vol. 1, see page 214.
N. J. A. Sloane, Seven Staggering Sequences, in Homage to a Pied Puzzler, E. Pegg Jr., A. H. Schoen and T. Rodgers (editors), A. K. Peters, Wellesley, MA, 2009, pp. 93-110.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..10000
Megumi Asada, Bruce Fang, Eva Fourakis, Sarah Manski, Nathan McNew, Steven J. Miller, Gwyneth Moreland, Ajmain Yamin, and Sindy Xin Zhang, Avoiding 3-Term Geometric Progressions in Hurwitz Quaternions, Williams College (2023).
Barry Brent, Quadratic Minima and Modular Forms, Experimental Mathematics, Vol. 7, No. 3 (1998), 257-274.
Michael Gilleland, Some Self-Similar Integer Sequences.
Fern Gossow, Lyndon-like cyclic sieving and Gauss congruence, arXiv:2410.05678 [math.CO], 2024. See p. 26.
Nadia Heninger, E. M. Rains, and N. J. A. Sloane, On the Integrality of n-th Roots of Generating Functions, arXiv:math/0509316 [math.NT], 2005-2006; J. Combinatorial Theory, Series A, 113 (2006), 1732-1745.
Masao Koike, Modular forms on non-compact arithmetic triangle groups, Unpublished manuscript [Extensively annotated with OEIS A-numbers by N. J. A. Sloane, Feb 14 2021. I wrote 2005 on the first page but the internal evidence suggests 1997.]
Gabriele Nebe and N. J. A. Sloane, Home page for D_4 lattice
N. J. A. Sloane, The 24 minimal vectors form the 24-cell polytope.
N. J. A. Sloane, Seven Staggering Sequences.
Eric Weisstein's World of Mathematics, 24-Cell.
Eric Weisstein's World of Mathematics, Barnes-Wall Lattice.
Eric Weisstein's World of Mathematics, Eisenstein Series.
Wikipedia, Hurwitz quaternion.
Index entries for "core" sequences.
Index entries for sequences related to Barnes-Wall lattices.
Index entries for sequences related to D_4 lattice.
Index entries for sequences related to Eisenstein series.

Cf. A002388, A000118, A000593, A008658, A096727, A108092, A108096.
Cf. A004016, A005882, A005928.
Partial sums give A046949.
Cf. A108092 (convolution fourth root).

Basis( ModularForms( Gamma0(2), 2), 54) [1]; /* Michael Somos, May 27 2014 */

readlib(ifactors): with(numtheory): for n from 1 to 100 do if n mod 2 = 0 then m := n/ifactors(n)[2][1][1]^ifactors(n)[2][1][2] else m := n fi: printf(`%d,`,24*sigma(m)) od: # James Sellers, Dec 07 2000

a[ n_] := If[ n < 0, 0, With[ {m = Floor @ Sqrt[4 n]}, SeriesCoefficient[ Sum[ q^( x^2 + y^2 + z^2 + t^2 + (x + y + z) t ), {x, -m, m}, {y, -m, m}, {z, -m, m}, {t, -m, m}] + O[q]^(n + 1), n]]]; (* Michael Somos, Jan 11 2011 *)
a[n_] := 24*Total[ Select[ Divisors[n], OddQ]]; a[0]=1; Table[a[n], {n, 0, 52}] (* Jean-François Alcover, Sep 12 2012 *)
a[ n_] := With[{m = InverseEllipticNomeQ @q}, SeriesCoefficient[ (1 + m) (EllipticK[ m] / (Pi/2))^2, {q, 0, n}]]; (* Michael Somos, Jun 04 2013 *)
a[ n_] := With[{m = InverseEllipticNomeQ @q}, SeriesCoefficient[ (1 - m/2) (EllipticK[ m] / (Pi/2))^2, {q, 0, 2 n}]]; (* Michael Somos, Jun 04 2013 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, q]^4 + EllipticTheta[ 2, 0, q]^4, {q, 0, n}]; (* Michael Somos, Jun 04 2013 *)
a[ n_] := SeriesCoefficient[ (EllipticTheta[ 3, 0, q]^4 + EllipticTheta[ 4, 0, q]^4) / 2, {q, 0, 2 n}]; (* Michael Somos, Jun 04 2013 *)

{a(n) = if( n<1, n==0, 24 * sumdiv( n, d, d%2 * d))}; /* Michael Somos, Apr 17 2000 */

{a(n) = my(G); if( n<0, 0, G = [2, 1, 1, 1; 1, 2, 0, 0; 1, 0, 2, 0; 1, 0, 0, 2]; polcoeff( 1 + 2 * x * Ser(qfrep( G, n, 1)), n))}; /* Michael Somos, Sep 11 2007 */

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^2 + A)^20 / (eta(x + A) * eta(x^4 + A))^8 + 16 * x * eta(x^4 + A)^8 / eta(x^2 + A)^4, n))}; /* Michael Somos, Oct 21 2017 */

from sympy import divisors
def a(n): return 1 if n==0 else 24*sum(d for d in divisors(n) if d%2)
print([a(n) for n in range(101)]) # Indranil Ghosh, Jun 24 2017

from math import prod
from sympy import factorint
def A004011(n): return 24*prod((p**(e+1)-1)//(p-1) for p, e in factorint(n).items() if p > 2) if n else 1 # Chai Wah Wu, Nov 13 2022

ModularForms( Gamma0(2), 2, prec=54).0; # Michael Somos, Jun 04 2013

a(0) = 1; if n>0 then a(n) = 24 (Sum_{d|n, d odd, d>0} d) = 24 * A000593(n).
G.f.: 1 + 24 Sum_{n>0} n x^n /(1 + x^n). a(n) = A000118(2*n) = A096727(2*n).
G.f.: (1/2) * (theta_3(z)^4 + theta_4(z)^4) = theta_3(2z)^4 + theta_2(2z)^4 = Sum_{k>=0} a(k) * x^(2*k).
G.f.: Sum_{a, b, c, d in Z} x^(a^2 + b^2 + c^2 + d^2 + a*d + b*d + c*d). - Michael Somos, Jan 11 2011
Expansion of (1 + k^2) * K(k^2)^2 / (Pi/2)^2 in powers of nome q. - Michael Somos, Jun 10 2006
Expansion of (1 - k^2/2) * K(k^2)^2 / (Pi/2)^2 in powers of nome q^2. - Michael Somos, Mar 14 2012
Expansion of b(x) * b(x^2) + 3 * c(x) * c(x^2) in powers of x where b(), c() are cubic AGM theta functions. - Michael Somos, Jan 11 2011
Expansion of b(x) * b(x^2) + c(x) * c(x^2) / 3 in powers of x^3 where b(), c() are cubic AGM theta functions. - Michael Somos, Mar 14 2012
G.f. is a period 1 Fourier series which satisfies f(-1 / (2 t)) = 2 (t/i)^2 f(t) where q = exp(2 Pi i t). - Michael Somos, Sep 11 2007
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u^2 - 2*u*v - 7*v^2 - 8*v*w + 16*w^2. - Michael Somos, May 29 2005
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u1^2 + 4*u2^2 + 9*u3^2 + 36*u6^2 - 2*u1*u2 - 10*u1*u3 + 10*u1*u6 + 10*u2*u3 - 40*u2*u6 - 18*u3*u6. - Michael Somos, Sep 11 2007
Sum_{k=1..n} a(k) ~ c * n^2, where c = Pi^2 = 9.869604... (A002388). - Amiram Eldar, Dec 29 2023

Additional comments from Barry Brent (barryb(AT)primenet.com)

cp's OEIS Frontend

A000203 a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

APL

GAP

Haskell

Magma

Magma

Maple

Mathematica

Maxima

MuPAD

PARI

PARI

PARI

PARI

Python

Python

SageMath

Scheme

Scheme

Formula

A000594 Ramanujan's tau function (or Ramanujan numbers, or tau numbers).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Julia

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

PARI

Python

Ruby

Ruby

Sage

Sage

Formula

A004009 Expansion of Eisenstein series E_4(q) (alternate convention E_2(q)); theta series of E_8 lattice.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Sage

Formula

A013973 Expansion of Eisenstein series E_6(q) (alternate convention E_3(q)).

Views

Author

Keywords