cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A356038 a(n) = Sum_{k=1..n} binomial(n,k) * sigma_2(k).

This page as a plain text file.
%I A356038 #17 Feb 16 2025 08:34:03
%S A356038 1,7,28,95,286,802,2143,5519,13807,33762,81060,191678,447396,1032647,
%T A356038 2360593,5351231,12041764,26920297,59829006,132262550,290990077,
%U A356038 637429514,1390811841,3023647046,6551547161,14151910442,30481920523,65480947739,140318385088,299995596747
%N A356038 a(n) = Sum_{k=1..n} binomial(n,k) * sigma_2(k).
%H A356038 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DivisorFunction.html">Divisor Function</a>.
%F A356038 a(n) ~ zeta(3) * n^2 * 2^(n-2).
%F A356038 a(n) = Sum_{i=1..n} Sum_{j=1..n} (i^2)*binomial(n,i*j). - _Ridouane Oudra_, Oct 25 2022
%p A356038 with(numtheory): seq(add(sigma[2](i)*binomial(n,i),i=1..n), n=1..60); # _Ridouane Oudra_, Oct 25 2022
%t A356038 Table[Sum[Binomial[n, k] * DivisorSigma[2, k], {k, 1, n}], {n, 1, 40}]
%o A356038 (PARI) a(n) = sum(k=1, n, binomial(n,k) * sigma(k, 2)); \\ _Michel Marcus_, Jul 24 2022
%Y A356038 Cf. A001157, A160399, A185003, A356039.
%Y A356038 Cf. A006218, A024916, A064602, A064603.
%K A356038 nonn
%O A356038 1,2
%A A356038 _Vaclav Kotesovec_, Jul 24 2022