A038040 -id:A038040 - cp's OEIS frontend

A309731 Expansion of Sum_{k>=1} k * x^k/(1 - x^k)^3.

1, 5, 9, 20, 20, 48, 35, 76, 72, 110, 77, 204, 104, 196, 210, 288, 170, 405, 209, 480, 378, 440, 299, 816, 425, 598, 594, 868, 464, 1200, 527, 1104, 858, 986, 910, 1800, 740, 1216, 1170, 1960, 902, 2184, 989, 1980, 1890, 1748, 1175, 3216, 1470, 2475, 1938, 2704, 1484, 3456, 2090

Offset: 1

Ilya Gutkovskiy, Aug 14 2019

nonn

Dirichlet convolution of natural numbers (A000027) with triangular numbers (A000217).

Seiichi Manyama, Table of n, a(n) for n = 1..10000

Cf. A000005, A000027, A000203, A000217, A007437, A007503, A034715, A038040, A064987, A309732.

with(numtheory): seq(n*(tau(n)+sigma(n))/2, n=1..30); # Ridouane Oudra, Nov 28 2019

nmax = 55; CoefficientList[Series[Sum[k x^k/(1 - x^k)^3, {k, 1, nmax}], {x, 0, nmax}], x] // Rest
Table[DirichletConvolve[j, j (j + 1)/2, j, n], {n, 1, 55}]
Table[n (DivisorSigma[0, n] + DivisorSigma[1, n])/2, {n, 1, 55}]

a(n)=sumdiv(n,d,binomial(n/d+1,2)*d); \\ Andrew Howroyd, Aug 14 2019

a(n)=n*(numdiv(n) + sigma(n))/2; \\ Andrew Howroyd, Aug 14 2019

my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, binomial(k+1, 2)*x^k/(1-x^k)^2)) \\ Seiichi Manyama, Apr 19 2021

G.f.: Sum_{k>=1} (k*(k + 1)/2) * x^k/(1 - x^k)^2.
a(n) = n * (d(n) + sigma(n))/2.
Dirichlet g.f.: zeta(s-1) * (zeta(s-2) + zeta(s-1))/2.
a(n) = Sum_{k=1..n} k*tau(gcd(n,k)). - Ridouane Oudra, Nov 28 2019

A334466 Square array read by antidiagonals upwards: T(n,k) is the total number of parts in all partitions of n into consecutive parts that differ by k, with n >= 1, k >= 0.

Original entry on oeis.org

1, 3, 1, 4, 1, 1, 7, 3, 1, 1, 6, 1, 1, 1, 1, 12, 3, 3, 1, 1, 1, 8, 4, 1, 1, 1, 1, 1, 15, 3, 3, 3, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 18, 6, 3, 3, 3, 1, 1, 1, 1, 1, 12, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 28, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 24, 3, 6, 3, 3, 3, 3, 1

Offset: 1

Omar E. Pol, May 01 2020

The one-part partition n = n is included in the count.
The column k is related to (k+2)-gonal numbers, assuming that 2-gonals are the nonnegative numbers, 3-gonals are the triangular numbers, 4-gonals are the squares, 5-gonals are the pentagonal numbers, and so on.
Note that the number of parts for T(n,0) = A000203(n), equaling the sum of the divisors of n.
For fixed k>0, Sum_{j=1..n} T(j,k) ~ 2^(3/2) * n^(3/2) / (3*sqrt(k)). - Vaclav Kotesovec, Oct 23 2024

			Square array starts:
   n\k|   0  1  2  3  4  5  6  7  8  9 10 11 12
   ---+---------------------------------------------
   1  |   1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   2  |   3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   3  |   4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   4  |   7, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   5  |   6, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   6  |  12, 4, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, ...
   7  |   8, 3, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, ...
   8  |  15, 1, 3, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, ...
   9  |  13, 6, 4, 3, 1, 3, 1, 3, 1, 1, 1, 1, 1, ...
  10  |  18, 5. 3. 1. 3. 1, 3, 1, 3, 1, 1, 1, 1, ...
  11  |  12, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 1, 1, ...
  12  |  28, 4, 6, 4, 3, 1, 3, 1, 3, 1, 3, 1, 1, ...
  ...
For n = 9 we have that:
For k = 0 the partitions of 9 into consecutive parts that differ by 0 (or simply: the partitions of 9 into equal parts) are [9], [3,3,3], [1,1,1,1,1,1,1,1,1]. In total there are 13 parts, so T(9,0) = 13.
For k = 1 the partitions of 9 into consecutive parts that differ by 1 (or simply: the partitions of 9 into consecutive parts) are [9], [5,4], [4,3,2]. In total there are six parts, so T(9,1) = 6.
For k = 2 the partitions of 9 into consecutive parts that differ by 2 are [9], [5, 3, 1]. In total there are four parts, so T(9,2) = 4.

Columns k: A000203 (k=0), A204217 (k=1), A066839 (k=2), A330889 (k=3), A334464 (k=4), A334732 (k=5), A334949 (k=6), A377300 (k=7), A377301 (k=8).
Triangles whose row sums give the column k: A127093 (k=0), A285914 (k=1), A330466 (k=2) (conjectured), A330888 (k=3), A334462 (k=4), A334540 (k=5), A339947 (k=6).
Sequences of number of partitions related to column k: A000005 (k=0), A001227 (k=1), A038548 (k=2), A117277 (k=3), A334461 (k=4), A334541 (k=5), A334948 (k=6).
Tables of partitions related to column k: A010766 (k=0), A286001 (k=1), A332266 (k=2), A334945 (k=3), A334618 (k=4).
Polygonal numbers related to column k: A001477 (k=0), A000217 (k=1), A000290 (k=2), A000326 (k=3), A000384 (k=4), A000566 (k=5), A000567 (k=6).
Cf. A051735, A237048, A303300, A330887, A334460, A334465, A334946.
Cf. A038040, A245579, A060872, A334467, A327262, A334733, A334953.
Cf. A057145, A323345.

nmax = 14;
col[k_] := col[k] = CoefficientList[Sum[n x^(n(k n - k + 2)/2)/(1 - x^n), {n, 1, nmax}] + O[x]^(nmax+1), x];
T[n_, k_] := col[k][[n+1]];
Table[T[n-k, k], {n, 1, nmax}, {k, 0, n-1}] // Flatten (* Jean-François Alcover, Nov 30 2020 *)

The g.f. for column k is Sum_{n>=1} n*x^(n*(k*n-k+2)/2)/(1-x^n). (For proof, see A330889. - N. J. A. Sloane, Nov 21 2020)

A374777 Numerator of the mean abundancy index of the divisors of n.

Original entry on oeis.org

1, 5, 7, 17, 11, 35, 15, 49, 34, 11, 23, 119, 27, 75, 77, 129, 35, 85, 39, 187, 5, 115, 47, 343, 86, 135, 71, 85, 59, 77, 63, 107, 161, 175, 33, 289, 75, 195, 63, 539, 83, 25, 87, 391, 187, 235, 95, 301, 54, 43, 245, 153, 107, 355, 23, 105, 91, 295, 119, 1309, 123, 315

Offset: 1

Amiram Eldar, Jul 19 2024

First differs from A318491 at n = 27.

The abundancy index of a number k is sigma(k)/k = A017665(k)/A017666(k).

			For n = 2, n has 2 divisors, 1 and 2. Their abundancy indices are sigma(1)/1 = 1 and sigma(2)/2 = 3/2, and their mean abundancy index is (1 + 3/2)/2 = 5/4. Therefore a(2) = numerator(5/4) = 5.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000005, A000203, A013661, A017665, A017666, A038040, A060640, A245214, A318491, A318492, A374778 (denominators), A374779, A374780, A374781.

f[p_, e_] := ((e+1)*p^2 - (e+2)*p + p^(-e))/((e+1)*(p-1)^2); a[1] = 1; a[n_] := Numerator[Times @@ f @@@ FactorInteger[n]]; Array[a, 100]

a(n) = {my(f = factor(n), p, e); numerator(prod(i = 1, #f~, p = f[i, 1]; e = f[i, 2]; ((e+1)*p^2 - (e+2)*p + p^(-e))/((e+1)*(p-1)^2)));}

Let f(n) = a(n)/A374778(n). Then:
f(n) = (Sum_{d|n} sigma(d)/d) / tau(n), where sigma(n) is the sum of divisors of n (A000203), and tau(n) is their number (A000005).
f(n) is multiplicative with f(p^e) = ((e+1)*p^2 - (e+2)*p + p^(-e))/((e+1)*(p-1)^2).
f(n) = A318491(n)/(A318492(n)*A000005(n)).
f(n) = (Sum_{d|n} d*tau(d)) / (n*tau(n)) = A060640(n)/A038040(n).
Dirichlet g.f. of f(n): zeta(s) * Product_{p prime} ((p/(p-1)^2) * ((p^s-1)*log((1-1/p^s)/(1-1/p^(s+1))) + p-1)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} f(k) = Product_{p prime} ((p/(p-1)) * (1 - log(1 + 1/p))) = 1.3334768464... . For comparison, the asymptotic mean of the abundancy index over all the positive integers is zeta(2) = 1.644934... (A013661).
Lim sup_{n->oo} f(n) = oo (i.e., f(n) is unbounded).

A034718 Dirichlet convolution of b_n=n with b_n with b_n.

Original entry on oeis.org

1, 6, 9, 24, 15, 54, 21, 80, 54, 90, 33, 216, 39, 126, 135, 240, 51, 324, 57, 360, 189, 198, 69, 720, 150, 234, 270, 504, 87, 810, 93, 672, 297, 306, 315, 1296, 111, 342, 351, 1200, 123, 1134, 129, 792, 810, 414, 141, 2160, 294, 900, 459, 936, 159, 1620, 495

Offset: 1

Erich Friedman

Row sums of triangle A329323. - Omar E. Pol, Nov 21 2019

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000027, A001620, A007425, A038040, A082633, A329323.

Table[n*Sum[DivisorSigma[0, d], {d, Divisors[n]}], {n, 1, 100}] (* Vaclav Kotesovec, Aug 31 2018 *)
f[p_, e_] := (e+1)*(e+2)*p^e/2; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Sep 29 2020 *)

a(n) = Sum_{k*l*m = n} k*l*m, for positive integers k, l, m. This equals one sixth of the same sum over all integers. - Ralf Stephan, May 06 2005
Dirichlet g.f.: zeta^3(x-1).
Multiplicative with a(p^e) = p^e * binomial(e+2, 2). - Mitch Harris, Jun 27 2005
a(n) = n*A007425(n). Dirichlet convolution of A000027 by A038040. - R. J. Mathar, Mar 30 2011
Sum_{k=1..n} a(k) ~ (2*log(n)^2 + (12*gamma - 2)*log(n) + 12*gamma^2 - 6*gamma - 12*sg1 + 1) * n^2 / 8, where gamma is the Euler-Mascheroni constant A001620 and sg1 is the first Stieltjes constant (see A082633). - Vaclav Kotesovec, Sep 11 2019
G.f.: Sum_{k>=1} k*tau(k)*x^k / (1 - x^k)^2, where tau = A000005. - Ilya Gutkovskiy, Sep 22 2020

A322577 a(n) = Sum_{d|n} psi(n/d) * phi(d).

Original entry on oeis.org

1, 4, 6, 11, 10, 24, 14, 28, 26, 40, 22, 66, 26, 56, 60, 68, 34, 104, 38, 110, 84, 88, 46, 168, 74, 104, 102, 154, 58, 240, 62, 160, 132, 136, 140, 286, 74, 152, 156, 280, 82, 336, 86, 242, 260, 184, 94, 408, 146, 296, 204, 286, 106, 408, 220, 392, 228, 232, 118, 660

Offset: 1

Ilya Gutkovskiy, Aug 29 2019

Dirichlet convolution of Dedekind psi function (A001615) with Euler totient function (A000010).
Dirichlet convolution of A008966 with A018804.
Dirichlet convolution of A038040 with A271102.

Robert Israel, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Dedekind Function.
Eric Weisstein's World of Mathematics, Totient Function.

Cf. A000010, A001615, A008966, A018804, A038040, A271102.

Cf. A327251 (inverse Möbius transform), A347092 (Dirichlet inverse), A347093 (sum with it), A347135.

f:= proc(n) local t;
  mul((t[2]+1)*t[1]^t[2] - (t[2]-1)*t[1]^(t[2]-2), t = ifactors(n)[2])
end proc:
map(f, [$1..100]); # Robert Israel, Sep 01 2019

Table[Sum[DirichletConvolve[j, MoebiusMu[j]^2, j, n/d] EulerPhi[d], {d, Divisors[n]}], {n, 1, 60}]
f[p_, e_] := (e + 1)*p^e - (e - 1)*p^(e - 2); a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Oct 26 2020 *)

seq(n) = {dirmul(vector(n, n, eulerphi(n)), vector(n, n, n * sumdivmult(n, d, issquarefree(d)/d)))} \\ Andrew Howroyd, Aug 29 2019

A001615(n) = if(1==n,n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1)));
A322577(n) = sumdiv(n,d,A001615(n/d)*eulerphi(d)); \\ Antti Karttunen, Apr 03 2022

Dirichlet g.f.: zeta(s-1)^2 / zeta(2*s).
a(p) = 2*p, where p is prime.
Sum_{k=1..n} a(k) ~ 45*n^2*(2*Pi^4*log(n) - Pi^4 + 4*gamma*Pi^4 - 360*zeta'(4)) / (2*Pi^8), where gamma is the Euler-Mascheroni constant A001620 and for zeta'(4) see A261506. - Vaclav Kotesovec, Aug 31 2019
a(p^k) = (k+1)*p^k - (k-1)*p^(k-2) where p is prime. - Robert Israel, Sep 01 2019
a(n) = Sum_{k=1..n} psi(gcd(n,k)). - Ridouane Oudra, Nov 29 2019
a(n) = Sum_{k=1..n} psi(n/gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). - Richard L. Ollerton, May 07 2021

A343547 a(n) = n * Sum_{d|n} binomial(d+n-2,n-1)/d.

Original entry on oeis.org

1, 4, 9, 32, 75, 318, 931, 3712, 13014, 50110, 184767, 715656, 2704169, 10454976, 40126395, 155462016, 601080407, 2335849578, 9075135319, 35359120940, 137847221148, 538346579034, 2104098963743, 8234009441952, 32247603785500, 126414311404108, 495918587420145

Offset: 1

Seiichi Manyama, Apr 19 2021

nonn

Seiichi Manyama, Table of n, a(n) for n = 1..1000

Cf. A000203, A038040, A309731, A332508, A343544, A343545, A343546.

a[n_] := n * DivisorSum[n, Binomial[# + n - 2, n-1]/# &]; Array[a, 30] (* Amiram Eldar, Apr 25 2021 *)

a(n) = n*sumdiv(n, d, binomial(d+n-2, n-1)/d);

a(n) = [x^n] Sum_{k>=1} k * x^k/(1 - x^k)^n.

a(n) = [x^n] Sum_{k>=1} binomial(k+n-2,n-1) * x^k/(1 - x^k)^2.

A123229 Triangle read by rows: T(n, m) = n - (n mod m).

Original entry on oeis.org

1, 2, 2, 3, 2, 3, 4, 4, 3, 4, 5, 4, 3, 4, 5, 6, 6, 6, 4, 5, 6, 7, 6, 6, 4, 5, 6, 7, 8, 8, 6, 8, 5, 6, 7, 8, 9, 8, 9, 8, 5, 6, 7, 8, 9, 10, 10, 9, 8, 10, 6, 7, 8, 9, 10, 11, 10, 9, 8, 10, 6, 7, 8, 9, 10, 11, 12, 12, 12, 12, 10, 12, 7, 8, 9, 10, 11, 12, 13, 12, 12, 12, 10, 12, 7, 8, 9, 10, 11, 12, 13

Offset: 1

Roger L. Bagula and Gary W. Adamson, Oct 06 2006

An equivalent definition: Consider A000012 as a lower-left all-1's triangle, and build the matrix product by multiplication with A127093 from the right. That is, T(n,m) = Sum_{j=m..n} A000012(n,j)*A127093(j,m) = Sum_{j=m..n} A127093(j,m) = m*floor(n/m) = m*A010766(n,m). - Gary W. Adamson, Jan 05 2007

The number of parts k in the triangle is A000203(k) hence the sum of parts k is A064987(k). - Omar E. Pol, Jul 05 2014

			Triangle begins:
{1},
{2, 2},
{3, 2, 3},
{4, 4, 3, 4},
{5, 4, 3, 4, 5},
{6, 6, 6, 4, 5, 6},
{7, 6, 6, 4, 5, 6, 7},
{8, 8, 6, 8, 5, 6, 7, 8},
{9, 8, 9, 8, 5, 6, 7, 8, 9},
...

G. C. Greubel, Rows n=1..100 of triangle, flattened

Cf. A074025, A093960.

Cf. also A024916 (row sums), A127093, A127094, A127096, A127097, A127098, A127099, A038040, A000203, A126988, A127013, A127057.

Flat(List([1..10],n->List([1..n],m->n-(n mod m)))); # Muniru A Asiru, Oct 12 2018

seq(seq(n-modp(n,m),m=1..n),n=1..13); # Muniru A Asiru, Oct 12 2018

a = Table[Table[n - Mod[n, m], {m, 1, n}], {n, 1, 20}]; Flatten[a]

for(n=1,9,for(m=1,n,print1(n-n%m", "))) \\ Charles R Greathouse IV, Nov 07 2011

Edited by N. J. A. Sloane, Jul 05 2014 at the suggestion of Omar E. Pol, who observed that A127095 (Gary W. Adamson, with edits by R. J. Mathar) was the same as this sequence.

A327262 a(n) is the sum of all parts of all partitions of n into consecutive parts that differ by 4.

Original entry on oeis.org

1, 2, 3, 4, 5, 12, 7, 16, 9, 20, 11, 24, 13, 28, 30, 32, 17, 54, 19, 40, 42, 44, 23, 72, 25, 52, 54, 84, 29, 90, 31, 96, 66, 68, 35, 144, 37, 76, 78, 120, 41, 126, 43, 132, 135, 92, 47, 192, 49, 150, 102, 156, 53, 162, 110, 168, 114, 116, 59, 300, 61, 124, 126, 192, 130, 264, 67, 204, 138, 210

Offset: 1

Omar E. Pol, Apr 30 2020

nonn

The one-part partition n = n is included in the count.

			For n = 28 there are three partitions of 28 into consecutive parts that differ by 4, including 28 as a valid partition. They are [28], [16, 12] and [13, 9, 5, 1]. The sum of the parts is [28] + [16 + 12] + [13 + 9 + 5 + 1] = 84, so a(28) = 84.

Cf. A334460, A334461.

Sequences of the same family where the parts differs by k are: A038040 (k=0), A245579 (k=1), A060872 (k=2), A334463 (k=3), this sequence (k=4), A334733 (k=5).

pn4[n_]:=Total[Flatten[Select[IntegerPartitions[n],Union[Abs[Differences[#]]]=={4}&]]]+n; Array[pn4,70] (* Harvey P. Dale, Nov 26 2023 *)

a(n) = n*A334461(n).

A328203 Expansion of Sum_{k>=1} k * x^k / (1 - x^(2*k))^2.

Original entry on oeis.org

1, 2, 5, 4, 8, 10, 11, 8, 20, 16, 17, 20, 20, 22, 42, 16, 26, 40, 29, 32, 58, 34, 35, 40, 53, 40, 74, 44, 44, 84, 47, 32, 90, 52, 94, 80, 56, 58, 106, 64, 62, 116, 65, 68, 174, 70, 71, 80, 102, 106, 138, 80, 80, 148, 146, 88, 154, 88, 89, 168, 92, 94, 241, 64, 172

Offset: 1

Ilya Gutkovskiy, Oct 07 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 1..20000
Jon Maiga, Computer-generated formulas for A328203, Sequence Machine.

Cf. A000005, A000079 (fixed points), A000203, A001227, A002131, A003602, A006519, A006918, A026741, A038040, A109168, A113415, A140472, A152211, A193356, A245579, A349353 (Dirichlet inverse), A349354.

Cf. also A347957.

a:=[]; for k in [1..65] do if IsOdd(k) then a[k]:=(k * #Divisors(k) + DivisorSigma(1,k)) / 2; else a[k]:=(k * (#Divisors(k) - #Divisors(k div 2)) + DivisorSigma(1,k) - DivisorSigma(1,k div 2)) / 2;  end if; end for; a; // Marius A. Burtea, Oct 07 2019

nmax = 65; CoefficientList[Series[Sum[k x^k/(1 - x^(2 k))^2, {k, 1, nmax}], {x, 0, nmax}], x] // Rest
a[n_] := DivisorSum[n, (n Mod[#, 2] + Boole[OddQ[n/#]] #)/2 &]; Table[a[n], {n, 1, 65}]

A328203(n) = if(n%2,(1/2)*(sigma(n)+(n*numdiv(n))),2*A328203(n/2)); \\ Antti Karttunen, Nov 13 2021

a(n) = (n * d(n) + sigma(n)) / 2 if n odd, (n * (d(n) - d(n/2)) + sigma(n) - sigma(n/2)) / 2 if n even.
a(n) = (n * A001227(n) + A002131(n)) / 2.
a(2*n) = 2 * a(n).
From Antti Karttunen, Nov 13 2021: (Start)
The following two convolutions were found by Jon Maiga's Sequence Machine search algorithm. Both are easy to prove:
a(n) = Sum_{d|n} A003602(d) * A026741(n/d).
a(n) = Sum_{d|n} A109168(d) * A193356(n/d), where A109168(d) = A140472(d) = (d+A006519(d))/2.
(End)

A336845 a(n) = A000005(n) * A003961(n), where A003961 is the prime shift towards larger primes, and A000005 gives the number of divisors of n, and also of A003961(n).

Original entry on oeis.org

1, 6, 10, 27, 14, 60, 22, 108, 75, 84, 26, 270, 34, 132, 140, 405, 38, 450, 46, 378, 220, 156, 58, 1080, 147, 204, 500, 594, 62, 840, 74, 1458, 260, 228, 308, 2025, 82, 276, 340, 1512, 86, 1320, 94, 702, 1050, 348, 106, 4050, 363, 882, 380, 918, 118, 3000, 364, 2376, 460, 372, 122, 3780, 134, 444, 1650, 5103, 476, 1560

Offset: 1

Antti Karttunen, Aug 06 2020

Dirichlet convolution of A003961 with itself.

Sequence is not injective, as it has duplicate values, for example: a(162) = a(243) = 18750. See also comments in A336475.

Antti Karttunen, Table of n, a(n) for n = 1..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
Index entries for sequences computed from indices in prime factorization

Cf. A000005, A000203, A000290, A003961, A038040, A336475.

Cf. also A336841, A336846 [= gcd(a(n),A003973(n))], A336847, A336848.

A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A336845(n) = (numdiv(n)*A003961(n))

A336845(n) = { my(f = factor(n)); prod(i=1, #f~, (1+f[i,2]) * (nextprime(1+f[i, 1])^f[i,2])); };

A336845(n) = sumdiv(n,d,A003961(d)*A003961(n/d));

Multiplicative with a(prime(i)^e) = (e+1) * prime(1+i)^e.
a(n) = A000005(n) * A003961(n).
a(n) = A038040(A003961(n)).
a(n) = A336841(n) + A003973(n).
a(n) is odd if and only if n is a square.

cp's OEIS Frontend

A309731 Expansion of Sum_{k>=1} k * x^k/(1 - x^k)^3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

Formula

A334466 Square array read by antidiagonals upwards: T(n,k) is the total number of parts in all partitions of n into consecutive parts that differ by k, with n >= 1, k >= 0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A374777 Numerator of the mean abundancy index of the divisors of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A034718 Dirichlet convolution of b_n=n with b_n with b_n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A322577 a(n) = Sum_{d|n} psi(n/d) * phi(d).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A343547 a(n) = n * Sum_{d|n} binomial(d+n-2,n-1)/d.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A123229 Triangle read by rows: T(n, m) = n - (n mod m).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP