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-3 of 3 results.

A318917 Expansion of e.g.f. exp(Sum_{k>=1} phi(k)*x^k/k), where phi is the Euler totient function A000010.

Original entry on oeis.org

1, 1, 2, 8, 38, 262, 1732, 16144, 153596, 1660796, 19415384, 264084064, 3664187848, 57366995272, 936097392752, 16131362629568, 302946516251408, 6034409270818576, 125044362929875744, 2756094464546395264, 63280996793936902496
Offset: 0

Views

Author

Vaclav Kotesovec, Sep 05 2018

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 20; CoefficientList[Series[Exp[Sum[EulerPhi[k]*x^k/k, {k, 1, nmax}]], {x, 0, nmax}], x] * Range[0, nmax]!
    a[n_] := a[n] = If[n == 0, 1, Sum[EulerPhi[k]* a[n-k], {k, 1, n}]/n]; Table[n! a[n], {n, 0, 20}]
  • PARI
    a(n) = if(n==0, 1, (n-1)!*sum(k=1, n, eulerphi(k)*a(n-k)/(n-k)!)); \\ Seiichi Manyama, Apr 29 2022

Formula

a(n)/n! ~ 3^(1/4) * exp(2*sqrt(6*n)/Pi) / (Pi * 2^(3/4) * n^(3/4)).
E.g.f.: Product_{k>=1} 1 / (1 - x^k)^f(k), where f(k) = (1/k) * Sum_{j=1..k} mu(gcd(k,j)). - Ilya Gutkovskiy, Aug 17 2021
a(0) = 1; a(n) = (n-1)! * Sum_{k=1..n} phi(k) * a(n-k)/(n-k)!. - Seiichi Manyama, Apr 29 2022
E.g.f.: exp( Sum_{n>=1} (mu(n)/n) * x^n/(1 - x^n) ), where mu(n) = A008683(n). - Paul D. Hanna, Jun 24 2023

A318814 Expansion of e.g.f. Product_{k>=1} ((1 + x^k)/(1 - x^k))^(sigma(k)/k).

Original entry on oeis.org

1, 2, 10, 64, 512, 4768, 53056, 645440, 8868352, 133302016, 2184149504, 38530160128, 733246566400, 14834910150656, 319778313883648, 7292507623063552, 175517505539538944, 4440588163825008640, 117969026857318678528, 3276703253565946855424, 95086071773832697348096
Offset: 0

Views

Author

Vaclav Kotesovec, Sep 04 2018

Keywords

Comments

Convolution of A305127 and A318769.

Crossrefs

Programs

  • Mathematica
    nmax = 20; CoefficientList[Series[Product[((1+x^k)/(1-x^k))^(DivisorSigma[1, k]/k), {k, 1, nmax}], {x, 0, nmax}], x] * Range[0, nmax]!

Formula

log(a(n)/n!) ~ Pi^2 * sqrt(n/6).

A305127 Expansion of e.g.f. Product_{k>=1} 1/(1 - x^k)^(sigma(k)/k), where sigma(k) is the sum of the divisors of k.

Original entry on oeis.org

1, 1, 5, 23, 179, 1279, 13699, 135085, 1764377, 22527521, 344625461, 5283739471, 94562354875, 1685808248383, 33947023942259, 694786150879829, 15613612524749489, 357353282848083265, 8880505496901812197, 224851013929747732231, 6106205671049245677251, 169523515381173773551871
Offset: 0

Views

Author

Ilya Gutkovskiy, May 26 2018

Keywords

Comments

a(n)/n! is the Euler transform of [1, 3/2, 4/3, 7/4, 6/5, ... = sums of reciprocals of divisors of 1, 2, 3, 4, 5, ...].

Crossrefs

Programs

  • Maple
    with(numtheory): a := proc(n) option remember; `if`(n = 0, 1, add(add(sigma(d), d = divisors(j))*a(n-j), j = 1..n)/n) end proc; seq(n!*a(n), n = 0..20); # Vaclav Kotesovec, Sep 04 2018
  • Mathematica
    nmax = 21; CoefficientList[Series[Product[1/(1 - x^k)^(DivisorSigma[1, k]/k), {k, 1, nmax}], {x, 0, nmax}], x] Range[0, nmax]!
    nmax = 21; CoefficientList[Series[Exp[Sum[Sum[x^(j k)/(j k (1 - x^(j k))), {j, 1, nmax}], {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]!
    a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d DivisorSigma[-1, d], {d, Divisors[k]}] a[n - k], {k, 1, n}]/n]; Table[n! a[n], {n, 0, 21}]
    nmax = 21; s = 1 - x; Do[s *= Sum[Binomial[DivisorSigma[1, k]/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] * Range[0, nmax]! (* Vaclav Kotesovec, Sep 03 2018 *)

Formula

E.g.f.: Product_{k>=1} 1/(1 - x^k)^(A017665(k)/A017666(k)).
E.g.f.: exp(Sum_{k>=1} Sum_{j>=1} x^(j*k)/(j*k*(1 - x^(j*k)))).
log(a(n)/n!) ~ sqrt(n) * Pi^2 / 3. - Vaclav Kotesovec, Sep 04 2018
Showing 1-3 of 3 results.