login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A272027
a(n) = 3*sigma(n).
23
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,1
COMMENTS
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)
FORMULA
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
MAPLE
with(numtheory): seq(3*sigma(n), n=1..64);
MATHEMATICA
Table[3 DivisorSigma[1, n], {n, 64}] (* Michael De Vlieger, Apr 19 2016 *)
PROG
(PARI) a(n) = 3 * sigma(n);
(Magma) [3*SumOfDivisors(n): n in [1..70]]; // Vincenzo Librandi, Jul 30 2019
CROSSREFS
Alternating row sums of triangle A272026.
k times sigma(n), k = 1..10: A000203, A074400, this sequence, A239050, A274535, A274536, A319527, A319528, A325299, A326122.
Sequence in context: A285564 A140979 A096726 * A310323 A212059 A226152
KEYWORD
nonn,easy
AUTHOR
Omar E. Pol, Apr 18 2016
STATUS
approved