A074400 -id:A074400 - 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.

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
(APL, Dyalog dialect) A000203 ← +/{ð←⍵{(0=⍵|⍺)/⍵}⍳⌊⍵*÷2 ⋄ 1=⍵:ð ⋄ ð,(⍵∘÷)¨(⍵=(⌊⍵*÷2)*2)↓⌽ð} ⍝ Antti Karttunen, Feb 20 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

A244050 Partial sums of A243980.

Original entry on oeis.org

4, 20, 52, 112, 196, 328, 492, 716, 992, 1340, 1736, 2244, 2808, 3468, 4224, 5104, 6056, 7164, 8352, 9708, 11192, 12820, 14544, 16508, 18596, 20852, 23268, 25908, 28668, 31716, 34892, 38320, 41940, 45776, 49804, 54196, 58740, 63524, 68532, 73900

Offset: 1

Omar E. Pol, Jun 18 2014

nonn

a(n) is also the volume of a special stepped pyramid with n levels related to the symmetric representation of sigma. Note that starting at the top of the pyramid, the total area of the horizontal regions at the n-th level is equal to A239050(n), and the total area of the vertical regions at the n-th level is equal to 8*n.
From Omar E. Pol, Sep 19 2015: (Start)
Also, consider that the area of the central square in the top of the pyramid is equal to 1, so the total area of the horizontal regions at the n-th level starting from the top is equal to sigma(n) = A000203(n), and the total area of the vertical regions at the n-th level is equal to 2*n.
Also note that this stepped pyramid can be constructed with four copies of the stepped pyramid described in A245092 back-to-back (one copy in every quadrant). (End)
From Omar E. Pol, Jan 20 2021: (Start)
Convolution of A000203 and the nonzero terms of A008586.
Convolution of A074400 and the nonzero terms of A005843.
Convolution of A340793 and the nonzero terms of A046092.
Convolution of A239050 and A000027.
(End)

			From _Omar E. Pol_, Aug 29 2015: (Start)
Illustration of the top view of the stepped pyramid with 16 levels. The pyramid is formed of 5104 unit cubes:
.                 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
.                |  _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _  |
.                | |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _| |
.             _ _| |  _ _ _ _ _ _ _ _ _ _ _ _ _ _  | |_ _
.           _|  _ _| |_ _ _ _ _ _ _ _ _ _ _ _ _ _| |_ _  |_
.         _|  _|  _| |  _ _ _ _ _ _ _ _ _ _ _ _  | |_  |_  |_
.        |  _|   |_ _| |_ _ _ _ _ _ _ _ _ _ _ _| |_ _|   |_  |
.   _ _ _| |  _ _|     |  _ _ _ _ _ _ _ _ _ _  |     |_ _  | |_ _ _
.  |  _ _ _|_| |      _| |_ _ _ _ _ _ _ _ _ _| |_      | |_|_ _ _  |
.  | | |  _ _ _|    _|_ _|  _ _ _ _ _ _ _ _  |_ _|_    |_ _ _  | | |
.  | | | | |  _ _ _| |  _| |_ _ _ _ _ _ _ _| |_  | |_ _ _  | | | | |
.  | | | | | | |  _ _|_|  _|  _ _ _ _ _ _  |_  |_|_ _  | | | | | | |
.  | | | | | | | | |  _ _|   |_ _ _ _ _ _|   |_ _  | | | | | | | | |
.  | | | | | | | | | | |  _ _|  _ _ _ _  |_ _  | | | | | | | | | | |
.  | | | | | | | | | | | | |  _|_ _ _ _|_  | | | | | | | | | | | | |
.  | | | | | | | | | | | | | | |  _ _  | | | | | | | | | | | | | | |
.  | | | | | | | | | | | | | | | |   | | | | | | | | | | | | | | | |
.  | | | | | | | | | | | | | | | |_ _| | | | | | | | | | | | | | | |
.  | | | | | | | | | | | | | |_|_ _ _ _|_| | | | | | | | | | | | | |
.  | | | | | | | | | | | |_|_  |_ _ _ _|  _|_| | | | | | | | | | | |
.  | | | | | | | | | |_|_    |_ _ _ _ _ _|    _|_| | | | | | | | | |
.  | | | | | | | |_|_ _  |_  |_ _ _ _ _ _|  _|  _ _|_| | | | | | | |
.  | | | | | |_|_ _  | |_  |_ _ _ _ _ _ _ _|  _| |  _ _|_| | | | | |
.  | | | |_|_ _    |_|_ _| |_ _ _ _ _ _ _ _| |_ _|_|    _ _|_| | | |
.  | |_|_ _ _  |     |_  |_ _ _ _ _ _ _ _ _ _|  _|     |  _ _ _|_| |
.  |_ _ _  | |_|_      | |_ _ _ _ _ _ _ _ _ _| |      _|_| |  _ _ _|
.        | |_    |_ _  |_ _ _ _ _ _ _ _ _ _ _ _|  _ _|    _| |
.        |_  |_  |_  | |_ _ _ _ _ _ _ _ _ _ _ _| |  _|  _|  _|
.          |_  |_ _| |_ _ _ _ _ _ _ _ _ _ _ _ _ _| |_ _|  _|
.            |_ _  | |_ _ _ _ _ _ _ _ _ _ _ _ _ _| |  _ _|
.                | |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _| |
.                | |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _| |
.                |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
.
Note that the above diagram contains a hidden pattern, simpler, which emerges from the front view of every corner of the stepped pyramid.
For more information about the hidden pattern see A237593 and A245092.
(End)

Robert G. Wilson v, Table of n, a(n) for n = 1..10000 (first 7342 terms from Robert Price)
Omar E. Pol, Illustration of a(11) = 1736, Perspective view of the stepped pyramid with 11 levels which contains 1736 unit cubes.

Cf. A000203, A024916, A046092, A008586, A175254, A196020, A235791, A236104, A237048, A237270, A237271, A237591, A237593, A239050, A239660, A239931, A239932, A239933, A239934, A243980, A245092, A262626, A340793.

[4*(&+[(n-k+1)*DivisorSigma(1,k): k in [1..n]]): n in [1..40]]; // G. C. Greubel, Apr 07 2019

a[n_] := 4 Sum[(n - k + 1) DivisorSigma[1, k], {k, n}]; Array[a, 40] (* Robert G. Wilson v, Aug 06 2018 *)
Nest[Accumulate,4*DivisorSigma[1,Range[50]],2] (* Harvey P. Dale, Sep 07 2022 *)

a(n) = 4*sum(k=1, n, sigma(k)*(n-k+1)); \\ Michel Marcus, Aug 07 2018

from math import isqrt
def A244050(n): return (((s:=isqrt(n))**2*(s+1)*((s+1)*((s<<1)+1)-6*(n+1))>>1) + sum((q:=n//k)*(-k*(q+1)*(3*k+(q<<1)+1)+3*(n+1)*((k<<1)+q+1)) for k in range(1,s+1))<<1)//3 # Chai Wah Wu, Oct 22 2023

[4*sum(sigma(k)*(n-k+1) for k in (1..n)) for n in (1..40)] # G. C. Greubel, Apr 07 2019

a(n) = 4*A175254(n).

A221529 Triangle read by rows: T(n,k) = A000203(k)*A000041(n-k), 1 <= k <= n.

Original entry on oeis.org

1, 1, 3, 2, 3, 4, 3, 6, 4, 7, 5, 9, 8, 7, 6, 7, 15, 12, 14, 6, 12, 11, 21, 20, 21, 12, 12, 8, 15, 33, 28, 35, 18, 24, 8, 15, 22, 45, 44, 49, 30, 36, 16, 15, 13, 30, 66, 60, 77, 42, 60, 24, 30, 13, 18, 42, 90, 88, 105, 66, 84, 40, 45, 26, 18, 12, 56, 126, 120, 154, 90, 132, 56, 75, 39, 36, 12, 28

Offset: 1

Omar E. Pol, Jan 20 2013

Since A000203(k) has a symmetric representation, both T(n,k) and the partial sums of row n can be represented by symmetric polycubes. For more information see A237593 and A237270. For another version see A245099. - Omar E. Pol, Jul 15 2014
From Omar E. Pol, Jul 10 2021: (Start)
The above comment refers to a symmetric tower whose terraces are the symmetric representation of sigma(i), for i = 1..n, starting from the top. The levels of these terraces are the partition numbers A000041(h-1), for h = 1 to n, starting from the base of the tower, where n is the length of the largest side of the base.
The base of the tower is the symmetric representation of A024916(n).
The height of the tower is equal to A000041(n-1).
The surface area of the tower is equal to A345023(n).
The volume (or the number of cubes) of the tower equals A066186(n).
The volume represents the n-th term of the convolution of A000203 and A000041, that is A066186(n).
Note that the terraces that are the symmetric representation of sigma(n) and the terraces that are the symmetric representation of sigma(n-1) both are unified in level 1 of the structure. That is because the first two partition numbers A000041 are [1, 1].
The tower is an object of the family of the stepped pyramid described in A245092.
T(n,k) can be represented with a set of A237271(k) right prisms of height A000041(n-k) since T(n,k) is the total number of cubes that are exactly below the parts of the symmetric representation of sigma(k) in the tower.
T(n,k) is also the sum of all divisors of all k's that are in the first n rows of triangle A336811, or in other words, in the first A000070(n-1) terms of the sequence A336811. Hence T(n,k) is also the sum of all divisors of all k's in the n-th row of triangle A176206.
The mentioned property is due to the correspondence between divisors and parts explained in A338156: all divisors of the first A000070(n-1) terms of A336811 are also all parts of all partitions of n.
Therefore the set of all partitions of n >= 1 has an associated tower.
The partial column sums of A340583 give this triangle showing the growth of the structure of the tower.
Note that the convolution of A000203 with any integer sequence S can be represented with a symmetric tower or structure of the same family where its terraces are the symmetric representation of sigma starting from the top and the heights of the terraces starting from the base are the terms of the sequence S. (End)

			Triangle begins:
------------------------------------------------------
    n| k    1   2   3   4   5   6   7   8   9  10
------------------------------------------------------
    1|      1;
    2|      1,  3;
    3|      2,  3,  4;
    4|      3,  6,  4,  7;
    5|      5,  9,  8,  7,  6;
    6|      7, 15, 12, 14,  6, 12;
    7|     11, 21, 20, 21, 12, 12,  8;
    8|     15, 33, 28, 35, 18, 24,  8, 15;
    9|     22, 45, 44, 49, 30, 36, 16, 15, 13;
   10|     30, 66, 60, 77, 42, 60, 24, 30, 13, 18;
...
The sum of row 10 is [30 + 66 + 60 + 77 + 42 + 60 + 24 + 30 + 13 + 18] = A066186(10) = 420.
.
For n = 10 the calculation of the row 10 is as follows:
    k    A000203         T(10,k)
    1       1   *  30   =   30
    2       3   *  22   =   66
    3       4   *  15   =   60
    4       7   *  11   =   77
    5       6   *   7   =   42
    6      12   *   5   =   60
    7       8   *   3   =   24
    8      15   *   2   =   30
    9      13   *   1   =   13
   10      18   *   1   =   18
                 A000041
.
From _Omar E. Pol_, Jul 13 2021: (Start)
For n = 10 we can see below three views of two associated polycubes called here "prism of partitions" and "tower". Both objects contain the same number of cubes (that property is valid for n >= 1).
        _ _ _ _ _ _ _ _ _ _
  42   |_ _ _ _ _          |
       |_ _ _ _ _|_        |
       |_ _ _ _ _ _|_      |
       |_ _ _ _      |     |
       |_ _ _ _|_ _ _|_    |
       |_ _ _ _        |   |
       |_ _ _ _|_      |   |
       |_ _ _ _ _|_    |   |
       |_ _ _      |   |   |
       |_ _ _|_    |   |   |
       |_ _    |   |   |   |
       |_ _|_ _|_ _|_ _|_  |                             _
  30   |_ _ _ _ _        | |                            | | 30
       |_ _ _ _ _|_      | |                            | |
       |_ _ _      |     | |                            | |
       |_ _ _|_ _ _|_    | |                            | |
       |_ _ _ _      |   | |                            | |
       |_ _ _ _|_    |   | |                            | |
       |_ _ _    |   |   | |                            | |
       |_ _ _|_ _|_ _|_  | |                           _|_|
  22   |_ _ _ _        | | |                          |   |  22
       |_ _ _ _|_      | | |                          |   |
       |_ _ _ _ _|_    | | |                          |   |
       |_ _ _      |   | | |                          |   |
       |_ _ _|_    |   | | |                          |   |
       |_ _    |   |   | | |                          |   |
       |_ _|_ _|_ _|_  | | |                         _|_ _|
  15   |_ _ _ _      | | | |                        | |   |  15
       |_ _ _ _|_    | | | |                        | |   |
       |_ _ _    |   | | | |                        | |   |
       |_ _ _|_ _|_  | | | |                       _|_|_ _|
  11   |_ _ _      | | | | |                      | |     |  11
       |_ _ _|_    | | | | |                      | |     |
       |_ _    |   | | | | |                      | |     |
       |_ _|_ _|_  | | | | |                     _| |_ _ _|
   7   |_ _ _    | | | | | |                    |   |     |   7
       |_ _ _|_  | | | | | |                   _|_ _|_ _ _|
   5   |_ _    | | | | | | |                  | | |       |   5
       |_ _|_  | | | | | | |                 _| | |_ _ _ _|
   3   |_ _  | | | | | | | |               _|_ _|_|_ _ _ _|   3
   2   |_  | | | | | | | | |           _ _|_ _|_|_ _ _ _ _|   2
   1   |_|_|_|_|_|_|_|_|_|_|          |_ _|_|_|_ _ _ _ _ _|   1
.
             Figure 1.                       Figure 2.
         Front view of the                 Lateral view
        prism of partitions.               of the tower.
.
.                                      _ _ _ _ _ _ _ _ _ _
                                      |   | | | | | | | |_|   1
                                      |   | | | | | |_|_ _|   2
                                      |   | | | |_|_  |_ _|   3
                                      |   | |_|_    |_ _ _|   4
                                      |   |_ _  |_  |_ _ _|   5
                                      |_ _    |_  |_ _ _ _|   6
                                          |_    | |_ _ _ _|   7
                                            |_  |_ _ _ _ _|   8
                                              |           |   9
                                              |_ _ _ _ _ _|  10
.
                                             Figure 3.
                                             Top view
                                           of the tower.
.
Figure 1 is a two-dimensional diagram of the partitions of 10 in colexicographic order (cf. A026792, A211992). The area of the diagram is 10*42 = A066186(10) = 420. Note that the diagram can be interpreted also as the front view of a right prism whose volume is 1*10*42 = 420 equaling the volume and the number of cubes of the tower that appears in the figures 2 and 3.
Note that the shape and the area of the lateral view of the tower are the same as the shape and the area where the 1's are located in the diagram of partitions. In this case the mentioned area equals A000070(10-1) = 97.
The connection between these two associated objects is a representation of the correspondence divisor/part described in A338156. See also A336812.
The sum of the volumes of both objects equals A220909.
For the connection with the table of A338156 see also A340035. (End)

Paolo Xausa, Table of n, a(n) for n = 1..11325 (rows 1..150 of triangle, flattened)
T. J. Osler, A. Hassen and T. R. Chandrupatia, Surprising connections between partitions and divisors, The College Mathematics Journal, Vol. 38. No. 4, Sep. 2007, 278-287 (see p. 287).
Omar E. Pol, Illustration of the prism, the tower and the 10th row of the triangle

Row sums give A066186.
Column 1 is A000041.
Leading diagonals 1-5: A000203, A000203, A074400, A272027, A274535.
Companion of A221530.
Cf. A000070, A000203, A026792, A027293, A135010, A138137, A176206, A182703, A220909, A211992, A221649, A236104, A237270, A237271, A237593, A245092, A245093, A245095, A245099, A262626, A336811, A336812, A338156, A339278, A340035, A340583, A340584, A345023, A346741.

nrows=12; Table[Table[DivisorSigma[1,k]PartitionsP[n-k],{k,n}],{n,nrows}] // Flatten (* Paolo Xausa, Jun 17 2022 *)

T(n,k)=sigma(k)*numbpart(n-k) \\ Charles R Greathouse IV, Feb 19 2013

T(n,k) = sigma(k)*p(n-k) = A000203(k)*A027293(n,k).

T(n,k) = A245093(n,k)*A027293(n,k).

A062731 Sum of divisors of 2*n.

Original entry on oeis.org

3, 7, 12, 15, 18, 28, 24, 31, 39, 42, 36, 60, 42, 56, 72, 63, 54, 91, 60, 90, 96, 84, 72, 124, 93, 98, 120, 120, 90, 168, 96, 127, 144, 126, 144, 195, 114, 140, 168, 186, 126, 224, 132, 180, 234, 168, 144, 252, 171, 217, 216, 210, 162, 280, 216, 248, 240, 210

Offset: 1

Jason Earls, Jul 11 2001

a(n) is also the total number of parts in all partitions of 2*n into equal parts. - Omar E. Pol, Feb 14 2021

N. J. A. Sloane, Table of n, a(n) for n = 1..20000 [First 1000 terms from Harry J. Smith]

Sigma(k*n): A000203 (k=1), A144613 (k=3), A193553 (k=4, even bisection), A283118 (k=5), A224613 (k=6), A283078 (k=7), A283122 (k=8), A283123 (k=9).
Cf. A008438, A074400, A182818, A239052 (odd bisection), A326124 (partial sums), A054784, A215947, A336923, A346870, A346878, A346880, A355750.
Row 2 of A319526. Column & Row 2 of A216626. Row 1 of A355927.
Shallow diagonal (2n,n) of A265652. See also A244658.

[SumOfDivisors(2*n): n in [1..70]]; // Vincenzo Librandi, Oct 31 2014

lst={};Do[AppendTo[lst, DivisorSigma[1, n]], {n, 2, 6!, 2}];lst (* Vladimir Joseph Stephan Orlovsky, Sep 20 2008 *)
DivisorSigma[1,2*Range[60]] (* Harvey P. Dale, Jun 08 2022 *)

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

PARI
```
vector(66,n,sigma(2*n,1))
```

for (n=1, 1000, write("b062731.txt", n, " ", sigma(2*n)) ) \\ Harry J. Smith, Aug 09 2009

a(n) = A000203(2*n). - R. J. Mathar, Apr 06 2011
a(n) = A000203(n) + A054785(n). - R. J. Mathar, May 19 2020
From Vaclav Kotesovec, Aug 07 2022: (Start)
Dirichlet g.f.: zeta(s) * zeta(s-1) * (3 - 2^(1-s)).
Sum_{k=1..n} a(k) ~ 5 * Pi^2 * n^2 / 24. (End)
From Miles Wilson, Sep 30 2024: (Start)
G.f.: Sum_{k>=1} k*x^(k/gcd(k, 2))/(1 - x^(k/gcd(k, 2))).
G.f.: Sum_{k>=1} k*x^(2*k/(3 + (-1)^k))/(1 - x^(2*k/(3 + (-1)^k))). (End)

Zero removed and offset corrected by Omar E. Pol, Jul 17 2009

A146076 Sum of even divisors of n.

Original entry on oeis.org

0, 2, 0, 6, 0, 8, 0, 14, 0, 12, 0, 24, 0, 16, 0, 30, 0, 26, 0, 36, 0, 24, 0, 56, 0, 28, 0, 48, 0, 48, 0, 62, 0, 36, 0, 78, 0, 40, 0, 84, 0, 64, 0, 72, 0, 48, 0, 120, 0, 62, 0, 84, 0, 80, 0, 112, 0, 60, 0, 144, 0, 64, 0, 126, 0, 96, 0, 108, 0, 96, 0, 182, 0, 76, 0, 120, 0, 112, 0, 180, 0, 84, 0, 192, 0, 88, 0, 168, 0, 156

Offset: 1

N. J. A. Sloane, Apr 09 2009

The usual OEIS policy is not to include sequences like this where alternate terms are zero; this is an exception. A074400 is the main entry.

a(n) is also the total number of parts in all partitions of n into an even number of equal parts. - Omar E. Pol, Jun 04 2017

Vincenzo Librandi, Table of n, a(n) for n = 1..10000

Cf. A000203, A000593, A006128, A038712, A065442, A074400, A183063, A222171.

A146076 := proc(n)
    if type(n,'even') then
        2*numtheory[sigma](n/2) ;
    else
        0;
    end if;
end proc: # R. J. Mathar, Dec 07 2017

f[n_] := Plus @@ Select[Divisors[n], EvenQ]; Array[f, 150] (* Vincenzo Librandi, May 17 2013 *)
a[n_] := DivisorSum[n, Boole[EvenQ[#]]*#&]; Array[a, 100] (* Jean-François Alcover, Dec 01 2015 *)
Table[CoefficientList[Series[-Log[QPochhammer[x^2, x^2]], {x, 0, 60}],x][[n + 1]] n, {n, 1, 60}] (* Benedict W. J. Irwin, Jul 04 2016 *)
a[n_] := If[OddQ[n], 0, 2*DivisorSigma[1, n/2]]; Array[a, 100] (* Amiram Eldar, Jan 11 2023 *)

vector(80, n, if (n%2, 0, sumdiv(n, d, d*(1-(d%2))))) \\ Michel Marcus, Mar 30 2015

a(n) = if (n%2, 0, 2*sigma(n/2)); \\ Michel Marcus, Apr 01 2015

a(2k-1) = 0, a(2k) = 2*sigma(k) for positive k.
Dirichlet g.f.: zeta(s - 1)*zeta(s)*2^(1 - s). - Geoffrey Critzer, Mar 29 2015
a(n) = A000203(n) - A000593(n). - Omar E. Pol, Apr 05 2016
L.g.f.: -log(Product_{ k>0 } (1-x^(2*k))) = Sum_{ n>=0 } (a(n)/n)*x^n. - Benedict W. J. Irwin, Jul 04 2016
a(n) = A000203(n)*(1 - (1/A038712(n))). - Omar E. Pol, Aug 01 2018
Sum_{k=1..n} a(k) ~ c * n^2, where c = Pi^2/24 = 0.411233... (A222171). - Amiram Eldar, Nov 06 2022
Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k)/A000203(k) = 2 - A065442 = 0.393304... . - Amiram Eldar, Dec 14 2024

Corrected by Jaroslav Krizek, May 07 2011

A239050 a(n) = 4*sigma(n).

Original entry on oeis.org

4, 12, 16, 28, 24, 48, 32, 60, 52, 72, 48, 112, 56, 96, 96, 124, 72, 156, 80, 168, 128, 144, 96, 240, 124, 168, 160, 224, 120, 288, 128, 252, 192, 216, 192, 364, 152, 240, 224, 360, 168, 384, 176, 336, 312, 288, 192, 496, 228, 372, 288, 392, 216, 480, 288, 480, 320, 360, 240, 672, 248, 384, 416, 508

Offset: 1

Omar E. Pol, Mar 09 2014

4 times the sum of divisors of n.

a(n) is also the total number of horizontal cells in the terraces of the n-th level of an irregular stepped pyramid (starting from the top) where the structure of every three-dimensional quadrant arises after the 90-degree zig-zag folding of every row of the diagram of the isosceles triangle A237593. The top of the pyramid is a square formed by four cells (see links and examples). - Omar E. Pol, Jul 04 2016

			For n = 4 the sum of divisors of 4 is 1 + 2 + 4 = 7, so a(4) = 4*7 = 28.
For n = 5 the sum of divisors of 5 is 1 + 5 = 6, so a(5) = 4*6 = 24.
.
Illustration of initial terms:                                    _ _ _ _ _ _
.                                           _ _ _ _ _ _          |_|_|_|_|_|_|
.                           _ _ _ _       _|_|_|_|_|_|_|_     _ _|           |_ _
.             _ _ _ _     _|_|_|_|_|_    |_|_|       |_|_|   |_|               |_|
.     _ _    |_|_|_|_|   |_|       |_|   |_|           |_|   |_|               |_|
.    |_|_|   |_|   |_|   |_|       |_|   |_|           |_|   |_|               |_|
.    |_|_|   |_|_ _|_|   |_|       |_|   |_|           |_|   |_|               |_|
.            |_|_|_|_|   |_|_ _ _ _|_|   |_|_         _|_|   |_|               |_|
.                          |_|_|_|_|     |_|_|_ _ _ _|_|_|   |_|_             _|_|
.                                          |_|_|_|_|_|_|         |_ _ _ _ _ _|
.                                                                |_|_|_|_|_|_|
.
n:     1          2             3                4                     5
S(n):  1          3             4                7                     6
a(n):  4         12            16               28                    24
.
For n = 1..5, the figure n represents the reflection in the four quadrants of the symmetric representation of S(n) = sigma(n) = A000203(n). For more information see A237270 and A237593.
The diagram also represents the top view of the first four terraces of the stepped pyramid described in Comments section. - _Omar E. Pol_, Jul 04 2016

Antti Karttunen, Table of n, a(n) for n = 1..10000
Omar E. Pol, Diagram of the triangle before the 90-degree-zig-zag folding (rows: 1..28)
Omar E. Pol, Folding the first eight rows of triangle
Index entries for sequences related to sigma(n)

Alternating row sums of A239662.
Partial sums give A243980.
k times sigma(n), k=1..6: A000203, A074400, A272027, this sequence, A274535, A274536.
k times sigma(n), k = 1..10: A000203, A074400, A272027, this sequence, A274535, A274536, A319527, A319528, A325299, A326122.
Cf. A008438, A017113, A062731, A112610, A144613, A193553, A196020, A235791, A236104, A237270, A237593, A239052, A239053, A239660, A239662, A244050, A262626.

[4*SumOfDivisors(n): n in [1..70]]; // Vincenzo Librandi, Jul 30 2019

with(numtheory): seq(4*sigma(n), n=1..64); # Omar E. Pol, Jul 04 2016

Array[4 DivisorSigma[1, #] &, 64] (* Michael De Vlieger, Nov 16 2017 *)

a(n) = 4 * sigma(n); \\ Omar E. Pol, Jul 04 2016

a(n) = 4*A000203(n) = 2*A074400(n).
a(n) = A000203(n) + A272027(n). - Omar E. Pol, Jul 04 2016
Dirichlet g.f.: 4*zeta(s-1)*zeta(s). - Ilya Gutkovskiy, Jul 04 2016
Conjecture: a(n) = sigma(3*n) = A144613(n) iff n is not a multiple of 3. - Omar E. Pol, Oct 02 2018
The conjecture above is correct. Write n = 3^e*m, gcd(3, m) = 1, then sigma(3*n) = sigma(3^(e+1))*sigma(m) = ((3^(e+2) - 1)/2)*sigma(m) = ((3^(e+2) - 1)/(3^(e+1) - 1))*sigma(3^e*m), and (3^(e+2) - 1)/(3^(e+1) - 1) = 4 if and only if e = 0. - Jianing Song, Feb 03 2019

A272027 a(n) = 3*sigma(n).

Original entry on oeis.org

3, 9, 12, 21, 18, 36, 24, 45, 39, 54, 36, 84, 42, 72, 72, 93, 54, 117, 60, 126, 96, 108, 72, 180, 93, 126, 120, 168, 90, 216, 96, 189, 144, 162, 144, 273, 114, 180, 168, 270, 126, 288, 132, 252, 234, 216, 144, 372, 171, 279, 216, 294, 162, 360, 216, 360, 240, 270, 180, 504, 186, 288, 312, 381

Offset: 1

Omar E. Pol, Apr 18 2016

3 times the sum of the divisors of n.
From Omar E. Pol, Jul 04 2016: (Start)
a(n) is also the total number of horizontal rhombuses in the terraces of the n-th level of an irregular stepped pyramid (starting from the top) where the structure of every 120-degree three-dimensional sector arises after the 120-degree zig-zag folding of every row of the diagram of the isosceles triangle A237593. The top of the pyramid is a hexagon formed by three rhombuses (see Links section).
More generally, if k >= 3 then k*sigma(n) is also the total number of horizontal rhombuses in the terraces of the n-th level of an irregular stepped pyramid where the structure of every 360/k three-dimensional sector arises after the 360/k-degree zig-zag folding of every row of the diagram of the isosceles triangle A237593. If k >= 5 the top of the pyramid is a k-pointed star formed by k rhombuses. (End)

Antti Karttunen, Table of n, a(n) for n = 1..10000
Omar E. Pol, Diagram of the triangle before the 120-degree-zig-zag folding (rows: 1..28)
Index entries for sequences related to sigma(n)

Alternating row sums of triangle A272026.
k times sigma(n), k = 1..10: A000203, A074400, this sequence, A239050, A274535, A274536, A319527, A319528, A325299, A326122.
Cf. A062731, A196020, A236104, A237270, A237593.

[3*SumOfDivisors(n): n in [1..70]]; // Vincenzo Librandi, Jul 30 2019

with(numtheory): seq(3*sigma(n), n=1..64);

Table[3 DivisorSigma[1, n], {n, 64}] (* Michael De Vlieger, Apr 19 2016 *)

PARI
```
a(n) = 3 * sigma(n);
```

a(n) = 3*A000203(n) = A000203(n) + A074400(n) = A239050(n) - A000203(n).
Dirichlet g.f.: 3*zeta(s-1)*zeta(s). - Ilya Gutkovskiy, Jul 04 2016
a(n) = A274536(n)/2. - Antti Karttunen, Nov 16 2017
From Omar E. Pol, Oct 02 2018: (Start)
Conjecture 1: a(n) = sigma(2*n) = A062731(n) iff n is odd.
And more generally:
Conjecture 2: If p is prime then (p + 1)*sigma(n) = sigma(p*n) iff n is not a multiple of p. (End)
The above claims easily follow from the fact that sigma is multiplicative function, thus if p does not divide n, then sigma(p*n) = sigma(p)*sigma(n). - Antti Karttunen, Nov 21 2019

A236106 Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the twice odd numbers (A016825) interleaved with k-1 zeros, and the first element of column k is in row k(k+1)/2.

Original entry on oeis.org

2, 6, 10, 2, 14, 0, 18, 6, 22, 0, 2, 26, 10, 0, 30, 0, 0, 34, 14, 6, 38, 0, 0, 2, 42, 18, 0, 0, 46, 0, 10, 0, 50, 22, 0, 0, 54, 0, 0, 6, 58, 26, 14, 0, 2, 62, 0, 0, 0, 0, 66, 30, 0, 0, 0, 70, 0, 18, 10, 0, 74, 34, 0, 0, 0, 78, 0, 0, 0, 6, 82, 38, 22, 0, 0, 2

Offset: 1

Omar E. Pol, Jan 23 2014

Gives an identity for the twice sigma function (A074400), the sum of the even divisors of 2n.
Alternating sum of row n equals A074400(n), i.e., Sum_{k=1..A003056(n)} (-1)^(k-1)*T(n,k) = 2*A000203(n) = A074400(n).
Row n has length A003056(n) hence the first element of column k is in row A000217(k).
The number of positive terms in row n is A001227(n).
For more information see A196020.

			Triangle begins:
  2;
  6;
  10,  2;
  14,  0;
  18,  6;
  22,  0,  2;
  26, 10,  0;
  30,  0,  0;
  34, 14,  6;
  38,  0,  0,  2;
  42, 18,  0,  0;
  46,  0, 10,  0;
  50, 22,  0,  0;
  54,  0,  0,  6;
  58, 26, 14,  0,  2;
  62,  0,  0,  0,  0;
  66, 30,  0,  0,  0;
  70,  0, 18, 10,  0;
  74, 34,  0,  0,  0;
  78,  0,  0,  0,  6;
  82, 38, 22,  0,  0,  2;
  86,  0,  0, 14,  0,  0;
  90, 42,  0,  0,  0,  0;
  94,  0, 26,  0,  0,  0;
  ...
For n = 9 the divisors of 2*9 = 18 are 1, 2, 3, 6, 9, 18, therefore the sum of the even divisors of 18 is 2 + 6 + 18 = 26. On the other hand the 9th row of triangle is 34, 14, 6, therefore the alternating row sum is 34 - 14 + 6 = 26, equaling the sum of the even divisors of 18.
If n is even then the alternating sum of the n-th row of triangle is simpler than the sum of the even divisors of 2n. Example: for n = 12 the sum of the even divisors of 2*12 = 24 is 2 + 4 + 6 + 8 + 12 + 24 = 56, and the alternating sum of the 12th row of triangle is 46 - 0 + 10 - 0 = 56.

Cf. A000203, A000217, A001227, A003056, A016825, A074400, A196020, A211343, A228813, A231345, A231347, A235791, A235794, A236104, A236112.

T(n,k) = 2*A196020(n,k).

A339106 Triangle read by rows: T(n,k) = A000203(n-k+1)*A000041(k-1), n >= 1, 1 <= k <= n.

Original entry on oeis.org

1, 3, 1, 4, 3, 2, 7, 4, 6, 3, 6, 7, 8, 9, 5, 12, 6, 14, 12, 15, 7, 8, 12, 12, 21, 20, 21, 11, 15, 8, 24, 18, 35, 28, 33, 15, 13, 15, 16, 36, 30, 49, 44, 45, 22, 18, 13, 30, 24, 60, 42, 77, 60, 66, 30, 12, 18, 26, 45, 40, 84, 66, 105, 88, 90, 42, 28, 12, 36, 39, 75, 56, 132, 90, 154, 120, 126, 56

Offset: 1

Omar E. Pol, Nov 23 2020

Conjecture 1: T(n,k) is the sum of all divisors of all (n - k + 1)'s in the n-th row of triangle A176206, assuming that A176206 has offset 1. The same for the triangle A340061.

Conjecture 2: the sum of row n equals A066186(n), the sum of all parts of all partitions of n.

			Triangle begins:
   1;
   3,  1;
   4,  3,  2;
   7,  4,  6,  3;
   6,  7,  8,  9,  5;
  12,  6, 14, 12, 15,  7;
   8, 12, 12, 21, 20, 21,  11;
  15,  8, 24, 18, 35, 28,  33,  15;
  13, 15, 16, 36, 30, 49,  44,  45,  22;
  18, 13, 30, 24, 60, 42,  77,  60,  66,  30;
  12, 18, 26, 45, 40, 84,  66, 105,  88,  90,  42;
  28, 12, 36, 39, 75, 56, 132,  90, 154, 120, 126, 56;
...
For n = 6 the calculation of every term of row 6 is as follows:
-------------------------
k   A000041        T(6,k)
1      1  *  12  =   12
2      1  *  6   =    6
3      2  *  7   =   14
4      3  *  4   =   12
5      5  *  3   =   15
6      7  *  1   =    7
.         A000203
-------------------------
The sum of row 6 is 12 + 6 + 14 + 12 + 15 + 7 = 66, equaling A066186(6).

Mirror of A221529.
Row sums give A066186 (conjectured).
Main diagonal gives A000041.
Columns 1 and 2 give A000203.
Column 3 gives A074400.
Column 4 gives A272027.
Column 5 gives A274535.
Column 6 gives A319527.
Cf. A176206, A340061.

T[n_, k_] := DivisorSigma[1, n - k + 1] * PartitionsP[k - 1]; Table[T[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* Amiram Eldar, Jan 08 2021 *)

T(n, k) = sigma(n-k+1)*numbpart(k-1); \\ Michel Marcus, Jan 08 2021

T(n,k) = sigma(n-k+1)*p(k-1), n >= 1, 1 <= k <= n.

A274535 a(n) = 5*sigma(n).

Original entry on oeis.org

5, 15, 20, 35, 30, 60, 40, 75, 65, 90, 60, 140, 70, 120, 120, 155, 90, 195, 100, 210, 160, 180, 120, 300, 155, 210, 200, 280, 150, 360, 160, 315, 240, 270, 240, 455, 190, 300, 280, 450, 210, 480, 220, 420, 390, 360, 240, 620, 285, 465, 360, 490, 270, 600, 360, 600, 400, 450, 300, 840, 310, 480, 520, 635

Offset: 1

Omar E. Pol, Jun 29 2016

5 times the sum of the divisors of n.

a(n) is also the total number of horizontal rhombuses in the terraces of the n-th level of an irregular stepped pyramid (starting from the top) in which the structure of every 72-degree-three-dimensional sector arises after the 72-degree-zig-zag folding of every row of the diagram of the isosceles triangle A237593. The top of the pyramid is a five-pointed star formed by five rhombuses (see Links section).

Antti Karttunen, Table of n, a(n) for n = 1..10000
Omar E. Pol, Diagram of the triangle before the 72-degree-zig-zag folding (rows: 1..28)
Index entries for sequences related to sigma(n)

k times sigma(n), k=1..6: A000203, A074400, A272027, A239050, this sequence, A274536.

Cf. A237593.

with(numtheory): seq(5*sigma(n), n=1..64);

Table[5 DivisorSigma[1, n], {n, 64}] (* Michael De Vlieger, Jul 04 2016 *)

PARI
```
a(n) = 5 * sigma(n);
```

a(n) = 5*A000203(n) = A000203(n) + A239050(n) = A074400(n) + A272027(n).

Dirichlet g.f.: 5*zeta(s-1)*zeta(s). - Ilya Gutkovskiy, Jul 04 2016

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

GAP

Haskell

Magma

Magma

Maple

Mathematica

Maxima

MuPAD

PARI

PARI

PARI

PARI

Python

Python

SageMath

Scheme

Scheme

Formula

A244050 Partial sums of A243980.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Sage

Formula

A221529 Triangle read by rows: T(n,k) = A000203(k)*A000041(n-k), 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A062731 Sum of divisors of 2*n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

MuPAD

PARI

PARI

Formula

Extensions

A146076 Sum of even divisors of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple