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.

Showing 1-6 of 6 results.

A174465 G.f.: exp( Sum_{n>=1} A174466(n)*x^n/n ) where A174466(n) = Sum_{d|n} d*sigma(n/d)*tau(d).

Original entry on oeis.org

1, 1, 4, 7, 19, 31, 74, 122, 258, 430, 835, 1378, 2557, 4162, 7382, 11932, 20471, 32676, 54634, 86251, 141001, 220371, 353413, 546783, 863043, 1322425, 2057525, 3125092, 4801297, 7230393, 10984924, 16410474, 24679719, 36593278, 54526145, 80272501
Offset: 0

Views

Author

Paul D. Hanna, Apr 04 2010

Keywords

Comments

Compare to the g.f. of the number of planar partitions of n (A000219):
exp( Sum_{n>=1} sigma_2(n)*x^n/n ) where sigma_2(n) = Sum_{d|n} d*sigma(n/d)*phi(d).
tau(n) = A000005(n) = the number of divisors of n,
and sigma(n) = A000203(n) = sum of divisors of n.

Links

Crossrefs

Cf. A174466, A000203 (sigma), A000005 (tau), A006171, A007425, A280473, A280487.

Programs

  • Mathematica
    nmax = 50; CoefficientList[Series[Product[1/(1-x^(i*j*k)), {i, 1, nmax}, {j, 1, nmax/i}, {k, 1, nmax/i/j}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jan 04 2017 *)
nmax = 50; A007425 = Table[Sum[DivisorSigma[0, d], {d, Divisors[n]}], {n, 1, nmax}]; s = 1 - x; Do[s *= Sum[Binomial[A007425[[k]], j]*(-1)^j*x^(j*k), {j, 0, nmax/k}]; s = Expand[s]; s = Take[s, Min[nmax + 1, Exponent[s, x] + 1, Length[s]]];, {k, 2, nmax}]; CoefficientList[Series[1/s, {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 30 2018 *)
  • PARI
    {a(n)=polcoeff(exp(sum(m=1,n,x^m/m*sumdiv(m,d,d*sigma(m/d)*sigma(d,0)))+x*O(x^n)),n)}

Formula

G.f.: Product_{i>=1, j>=1, k>=1} 1/(1 - x^(i*j*k)). - Vaclav Kotesovec, Jan 04 2017
G.f.: Product_{k>=1} 1/(1 - x^k)^tau_3(k), where tau_3() = A007425. - Ilya Gutkovskiy, May 22 2018

A280486 G.f.: Product_{i>=1, j>=1, k>=1, l>=1} (1 + x^(i*j*k*l)).

Original entry on oeis.org

1, 1, 4, 8, 20, 36, 86, 150, 314, 564, 1088, 1902, 3557, 6085, 10902, 18506, 32124, 53584, 91133, 149749, 249315, 405121, 662582, 1063152, 1714580, 2719842, 4327302, 6797316, 10686005, 16622003, 25861855, 39866017, 61422891, 93910783, 143406552, 217537696
Offset: 0

Views

Author

Vaclav Kotesovec, Jan 04 2017

Keywords

Links

Crossrefs

Cf. A000009, A007426, A107742, A280473, A280487, A219561.

Programs

  • Mathematica
    nmax = 50; CoefficientList[Series[Product[(1+x^(i*j*k*l)), {i, 1, nmax}, {j, 1, nmax/i}, {k, 1, nmax/i/j}, {l, 1, nmax/i/j/k}], {x, 0, nmax}], x]
nmax = 50; tau4 = Table[DivisorSum[n, DivisorSigma[0, n/#] * DivisorSigma[0, #] &], {n, 1, nmax}]; s = 1 + x; Do[s *= Sum[Binomial[tau4[[k]], j]*x^(j*k), {j, 0, nmax/k}]; s = Expand[s]; s = Take[s, Min[nmax + 1, Exponent[s, x] + 1, Length[s]]];, {k, 2, nmax}]; Take[CoefficientList[s, x], nmax + 1] (* Vaclav Kotesovec, Sep 08 2018 *)

Formula

G.f.: Product_{k>=1} (1 + x^k)^tau_4(k), where tau_4() = A007426. - Ilya Gutkovskiy, May 22 2018

A304965 Expansion of Product_{k>=1} 1/(1 - x^k)^tau_k(k), where tau_k(k) = number of ordered k-factorizations of k (A163767).

Original entry on oeis.org

1, 1, 3, 6, 19, 30, 96, 152, 461, 775, 1883, 3271, 8751, 14370, 34004, 59491, 140450, 239746, 541817, 932681, 2089189, 3606641, 7719178, 13398411, 28848808, 49603982, 103047935, 179154858, 370200348, 639269735, 1295389370, 2241994088, 4511677298, 7798101800, 15408901600
Offset: 0

Views

Author

Ilya Gutkovskiy, May 22 2018

Keywords

Comments

Euler transform of A163767.

Links

Crossrefs

Cf. A000219, A001970, A006171, A129373, A129374, A163767, A174465, A280487.

Programs

  • Maple
    A:= proc(n, k) option remember; `if`(k=1, 1,
      add(A(d, k-1), d=numtheory[divisors](n)))
    end:
a:= proc(n) option remember; `if`(n=0, 1, add(add(d*
      A(d$2), d=numtheory[divisors](j))*a(n-j), j=1..n)/n)
    end:
seq(a(n), n=0..40);  # Alois P. Heinz, May 22 2018
  • Mathematica
    nmax = 34; CoefficientList[Series[Product[1/(1 - x^k)^Times@@(Binomial[# + k - 1, k - 1]&/@FactorInteger[k][[All, 2]]), {k, 1, nmax}], {x, 0, nmax}], x]
a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d Times@@(Binomial[# + d - 1, d - 1]&/@FactorInteger[d][[All, 2]]), {d, Divisors[k]}] a[n - k], {k, 1, n}]/n]; Table[a[n], {n, 0, 34}]

Formula

G.f.: Product_{k>=1} 1/(1 - x^k)^A163767(k).

A304964 Expansion of 1/(1 - Sum_{i>=1, j>=1, k>=1, l>=1} x^(i*j*k*l)).

Original entry on oeis.org

1, 1, 5, 13, 47, 133, 443, 1333, 4263, 13143, 41419, 128791, 403815, 1259639, 3941579, 12310299, 38492034, 120271953, 375964616, 1174935195, 3672413322, 11477465221, 35872928244, 112117013835, 350417746650, 1095202995267, 3422999582632, 10698350241417, 33437065631262, 104505382585023
Offset: 0

Views

Author

Ilya Gutkovskiy, May 22 2018

Keywords

Comments

Invert transform of A007426.

Links

Crossrefs

Cf. A000005, A007426, A011782, A129921, A280486, A280487, A304963.

Programs

  • Maple
    A:= proc(n, k) option remember; `if`(k=1, 1,
      add(A(d, k-1), d=numtheory[divisors](n)))
    end:
a:= proc(n) option remember; `if`(n=0, 1,
      add(A(j, 4)*a(n-j), j=1..n))
    end:
seq(a(n), n=0..35);  # Alois P. Heinz, May 22 2018
  • Mathematica
    nmax = 29; CoefficientList[Series[1/(1 - Sum[x^(i j k l), {i, 1, nmax}, {j, 1, nmax/i}, {k, 1, nmax/i/j}, {l, 1, nmax/i/j/k}]), {x, 0, nmax}], x]
nmax = 29; CoefficientList[Series[1/(1 - Sum[Sum[DivisorSigma[0, d] DivisorSigma[0, k/d], {d, Divisors[k]}] x^k, {k, 1, nmax}]), {x, 0, nmax}], x]
a[0] = 1; a[n_] := a[n] = Sum[Sum[DivisorSigma[0, d] DivisorSigma[0, k/d], {d, Divisors[k]}] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 29}]

Formula

G.f.: 1/(1 - Sum_{k>=1} A007426(k)*x^k).

A321191 a(n) = [x^n] Product_{k>=1} 1/(1 - x^k)^tau_n(k), where tau_n(k) = number of ordered n-factorizations of k.

Original entry on oeis.org

1, 1, 3, 7, 29, 71, 336, 932, 4593, 13690, 69708, 222718, 1163734, 3902016, 20825927, 73229397, 397806717, 1452193925, 8016518379, 30328368519, 169781766056, 662143701506, 3755514158949, 15071604241851, 86496856963200, 356063096545571, 2066351471542036
Offset: 0

Views

Author

Ilya Gutkovskiy, Oct 29 2018

Keywords

Links

Crossrefs

Cf. A000041, A006171, A077592, A174465, A280487, A321192.

Programs

  • Mathematica
    tau[n_, 1] = 1; tau[n_, k_] := tau[n, k] = Plus @@ (tau[#, k-1] & /@ Divisors[n]); nmax = 30; Table[SeriesCoefficient[Product[1/(1 - x^k)^tau[k, n], {k, 1, n}], {x, 0, n}], {n, 0, nmax}] (* Vaclav Kotesovec, Oct 29 2018 *)

Formula

a(n) = [x^n] Product_{k_1>=1, k_2>=1, ..., k_n>=1} 1/(1 - x^(k_1*k_2*...*k_n)).

A321240 Expansion of Product_{i>=1, j>=1, k>=1, l>=1} (1 + x^(i*j*k*l))/(1 - x^(i*j*k*l)).

Original entry on oeis.org

1, 2, 10, 26, 86, 210, 594, 1394, 3530, 8006, 18842, 41258, 92190, 195714, 419538, 867050, 1797568, 3625758, 7311382, 14431294, 28416514, 55010142, 106101558, 201814518, 382213566, 715473554, 1333083950, 2459265058, 4515151234, 8218572030, 14888270366, 26766878302
Offset: 0

Views

Author

Seiichi Manyama, Nov 01 2018

Keywords

Comments

Convolution of the sequences A280486 and A280487.

Links

Crossrefs

Cf. A007426, A015128, A280486, A280487, A301554, A305050.

Programs

  • Magma
    m:=50; R:=PowerSeriesRing(Integers(), m); Coefficients(R!(   (&*[(&*[(&*[(&*[(1+x^(i*j*k*l))/(1-x^(i*j*k*l)): i in [1..m]]): j in [1..m]]): k in [1..m]]): l in [1..m]]))); // G. C. Greubel, Nov 01 2018
  • Mathematica
    With[{nmax=50}, CoefficientList[Series[Product[(1 + x^(i*j*k*l))/(1 - x^(i*j*k*l)), {i,1,nmax}, {j,1,nmax/i}, {k,1,nmax/i/j}, {l,1,nmax/i/j/k}], {x,0,nmax}], x]] (* G. C. Greubel, Nov 01 2018 *)
  • PARI
    m=50; x='x+O('x^m); Vec(prod(k=1,m, ((1+x^k)/(1-x^k))^ sumdiv(k, d, numdiv(k/d)*numdiv(d)))) \\ G. C. Greubel, Nov 01 2018

Formula

G.f.: Product_{k>=1} ((1 + x^k)/(1 - x^k))^A007426(k).
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.