|
%I #43 Sep 08 2022 08:46:13
%S 1,9,244,16513,48828126,13062296532,232630513987208,
%T 144115462954287105,8862938119746644274757,
%U 100000000186264514923632574038,191943424957750480504146841291812,8505622499882988712256991112913772434548,4695452425098908797088971409337422035076128814
%N a(n) = sigma_(prime(n))(n).
%H Anders Hellström, <a href="/A259673/b259673.txt">Table of n, a(n) for n = 1..50</a>
%H <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%F a(n) = sigma_(A000040(n))(n).
%F a(n) = [x^n] Sum_{k>=1} k^prime(n)*x^k/(1 - x^k). - _Ilya Gutkovskiy_, Sep 26 2017
%p a:= n-> numtheory[sigma][ithprime(n)](n):
%p seq(a(n), n=1..15); # _Alois P. Heinz_, Feb 10 2020
%t a[n_] := DivisorSigma[Prime[n], n]; Array[a, 13]
%t (* Second program: *)
%t a[n_] := SeriesCoefficient[Sum[k^Prime[n]*x^k/(1-x^k), {k, 1, n}], {x, 0, n}]; Array[a, 13] (* _Jean-François Alcover_, Sep 29 2017, from 2nd formula *)
%o (PARI) a(n) = sigma(n, prime(n)); \\ _Michel Marcus_, Jul 03 2015
%o (Magma) [DivisorSigma(NthPrime(n),n):n in [1..15]]; // _Vincenzo Librandi_, Jul 15 2015
%o (Python)
%o from sympy import divisor_sigma, prime
%o def A259673(n):
%o ....return divisor_sigma(n,prime(n)) # _Chai Wah Wu_, Jul 20 2015
%Y Cf. A000203 (sigma(n)), A000040 (prime(n)), A023887 (sigma_n(n)).
%Y Cf. A001157 (sigma_2), A001158 (sigma_3), A001160 (sigma_5), A013955 (sigma_7).
%K nonn,easy
%O 1,2
%A _Ilya Gutkovskiy_, Jul 03 2015
%E a(11) and a(12) from _Anders Hellström_, Jul 14 2015
| 