cp's OEIS Frontend

A356130 a(n) = Sum_{k=1..n} sigma_{n-1}(k).

%I A356130 #20 Oct 21 2023 19:39:06
%S A356130 1,4,16,111,999,12513,185683,3316418,67810767,1576561677,40862702931,
%T A356130 1171104916405,36722498575799,1251419967587955,46034784688102781,
%U A356130 1818440444592581068,76763036794222996512,3448830049286378614987,164309958491233496689189
%N A356130 a(n) = Sum_{k=1..n} sigma_{n-1}(k).
%H A356130 Seiichi Manyama, <a href="/A356130/b356130.txt">Table of n, a(n) for n = 1..387</a>
%H A356130 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A356130 a(n) = Sum_{k=1..n} k^(n-1) * floor(n/k).
%F A356130 a(n) = [x^n] (1/(1-x)) * Sum_{k>=1} k^(n-1) * x^k/(1 - x^k).
%t A356130 a[n_] := Sum[DivisorSigma[n-1, k], {k, 1, n}]; Array[a, 19] (* _Amiram Eldar_, Jul 28 2022 *)
%o A356130 (PARI) a(n) = sum(k=1, n, sigma(k, n-1));
%o A356130 (PARI) a(n) = sum(k=1, n, k^(n-1)*(n\k));
%o A356130 (Python)
%o A356130 from math import isqrt
%o A356130 from sympy import bernoulli
%o A356130 def A350130(n): return (((s:=isqrt(n))+1)*((b:=bernoulli(n))-bernoulli(n, s+1))+sum(k**(n-1)*n*((q:=n//k)+1)-b+bernoulli(n, q+1) for k in range(1,s+1)))//n if n>1 else 1 # _Chai Wah Wu_, Oct 21 2023
%Y A356130 Cf. A319194, A319649, A356129.
%K A356130 nonn
%O A356130 1,2
%A A356130 _Seiichi Manyama_, Jul 27 2022