(Translated by https://www.hiragana.jp/)
A184387 - OEIS
The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184387 a(n) = sum of numbers from 1 to sigma(n), where sigma(n) = A000203(n). 9
1, 6, 10, 28, 21, 78, 36, 120, 91, 171, 78, 406, 105, 300, 300, 496, 171, 780, 210, 903, 528, 666, 300, 1830, 496, 903, 820, 1596, 465, 2628, 528, 2016, 1176, 1485, 1176, 4186, 741, 1830, 1596, 4095, 903, 4656, 990, 3570, 3081, 2628, 1176, 7750, 1653, 4371 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{i = 1..sigma(n)} i = A000217(A000203(n)) = A000203(n)*(A000203(n) + 1)/2.
Sum_{k=1..n} a(k) = (5*zeta(3)/12) * n^3 + O(n^2*log(n)^2). - Amiram Eldar, Dec 08 2022
EXAMPLE
For n = 4; sigma(4) = 7; a(4) = 1+2+3+4+5+6+7 = 28.
MATHEMATICA
Array[PolygonalNumber@ DivisorSigma[1, #] &, 50] (* Michael De Vlieger, Nov 16 2017 *)
PROG
(PARI) a(n)=binomial(sigma(n)+1, 2) \\ Charles R Greathouse IV, Feb 14 2013
(Python)
from sympy import divisor_sigma
def A184387(n): return (m:=divisor_sigma(n))*(m+1)>>1 # Chai Wah Wu, Jul 05 2023
CROSSREFS
Sequence in context: A359145 A287989 A081394 * A295185 A225845 A014494
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Jan 12 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 22:00 EDT 2024. Contains 373134 sequences. (Running on oeis4.)