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

A118206 Euler transform of the Liouville function.

Original entry on oeis.org

1, 1, 0, -1, 0, 0, 0, -1, -1, 0, 2, 0, -2, -2, 1, 2, 2, -2, -2, 0, 2, -1, -1, -2, 2, 5, 4, -5, -5, -2, 4, 2, -2, -7, 3, 8, 5, -7, -6, 1, 14, 4, -9, -14, 2, 5, 5, -10, -7, 6, 22, 3, -12, -20, 1, 15, 15, -16, -12, 4, 25, 6, -14, -31, 13, 33, 14, -39, -32, -6, 39, 15, -20, -31, 33, 41, 14, -53, -44, 3, 66, 12, -35, -51, 22, 48, 36, -60, -43, 21
Offset: 0

Views

Author

Stuart Clary, Apr 15 2006

Keywords

Links

Crossrefs

Cf. A118205, A118207, A118208, A061020, A117209.

Programs

  • Mathematica
    nmax = 100; lambda[k_Integer?Positive] := If[ k > 1, (-1)^Total[ Part[Transpose[FactorInteger[k]], 2] ], 1 ]; CoefficientList[ Series[ Product[ (1 - x^k)^(-lambda[k]), {k, 1, nmax} ], {x, 0, nmax} ], x ]
max = 100; s = Product[(1 - x^k)^(-LiouvilleLambda[k]), {k, 1, max}] + O[x]^max; CoefficientList[s, x] (* Jean-François Alcover, Dec 23 2015 *)
  • PARI
    {a(n)=polcoeff(exp(sum(m=1,n,sumdiv(m,d,d*moebius(core(d)))*x^m/m)+x*O(x^n)),n)} /* Cf. A061020 - Paul D. Hanna, Sep 22 2011 */

Formula

G.f.: A(x) = Product_{k>=1} (1 - x^k)^(-lambda(k)) where lambda(k) is the Liouville function, A008836.
Logarithmic derivative yields A061020. - Paul D. Hanna, Sep 22 2011
G.f.: A(x) = Product_{k >= 1} C(2*k,x^k), where C(k,x) denotes the k-th cyclotomic polynomial. - Peter Bala, Mar 31 2023

A118205 Euler transform of the negative of the Liouville function.

Original entry on oeis.org

1, -1, 1, 0, -1, 2, -2, 2, 0, -2, 3, -2, 1, 2, -3, 3, -2, 0, 3, -2, 3, -2, 0, 2, -2, 3, -1, 0, 1, -2, 5, 0, 0, 1, -2, 1, 1, 2, 0, 1, -2, 1, 4, -1, 4, -2, -3, 6, -2, 5, 6, -8, 6, -4, 2, 9, -8, 7, -4, -1, 11, -1, 5, 1, -8, 5, 2, 4, 7, -8, 4, 2, 1, 14, -2, 0, -1, -6, 19, 2, 5, 6, -15, 12, 1, 3, 18, -17, 1, 9, 0, 29, -4, -3, 4, -13, 14, 17, 2, 0, -4
Offset: 0

Views

Author

Stuart Clary, Apr 15 2006

Keywords

Links

Crossrefs

Cf. A061020, A117208, A118206, A118207, A118208.

Programs

  • Mathematica
    nmax = 100; lambda[k_Integer?Positive] := If[ k > 1, (-1)^Total[ Part[Transpose[FactorInteger[k]], 2] ], 1 ]; CoefficientList[ Series[ Product[ (1 - x^k)^lambda[k], {k, 1, nmax} ], {x, 0, nmax} ], x ]
(* Second program (needs Mma >= 7.0): *)
nmax = 100;
Product[(1 - x^n)^LiouvilleLambda[n], {n, 1, nmax}] + O[x]^(nmax+1) // CoefficientList[#, x]& (* Jean-François Alcover, Jan 08 2020 *)

Formula

G.f.: A(x) = Product_{k>=1} (1 - x^k)^lambda(k) where lambda(k) is the Liouville function, A008836.
G.f.: A(x) = - Product_{k >= 1} C(k,x^k), where C(k,x) denotes the k-th cyclotomic polynomial. - Peter Bala, Mar 31 2023

A118208 G.f.: A(x) = Product_{k>=1} (1 + x^k)^(-lambda(k)) where lambda(k) is the Liouville function, A008836.

Original entry on oeis.org

1, -1, 2, -1, 0, 2, -4, 5, -3, 0, 4, -6, 6, -2, -3, 8, -10, 6, 0, -6, 14, -13, 9, 0, -12, 17, -18, 11, 3, -18, 28, -22, 14, 7, -25, 30, -31, 11, 12, -23, 34, -28, 9, 12, -30, 35, -31, 10, 11, -30, 56, -35, 26, -4, -41, 51, -65, 48, -8, -28, 65, -74, 70, -9, -49, 71, -112, 69, -4, -48, 135, -129, 82, -21, -83, 155, -176, 99, 0
Offset: 0

Views

Author

Stuart Clary, Apr 15 2006

Keywords

Links

Crossrefs

Cf. A118205, A118206, A118207, A118209, A117211.

Programs

  • Mathematica
    nmax = 80; lambda[k_Integer?Positive] := If[ k > 1, (-1)^Total[ Part[Transpose[FactorInteger[k]], 2] ], 1 ]; CoefficientList[ Series[ Product[ (1 + x^k)^(-lambda[k]), {k, 1, nmax} ], {x, 0, nmax} ], x ]

Formula

G.f.: A(x) = Product_{k >= 1} C(k,x^k)*C(2*k,x^(2*k)), where C(k,x) denotes the k-th cyclotomic polynomial. - Peter Bala, Mar 31 2023

A118209 Expansion of Sum_{k>=1} lambda(k) * k * x^k/(1 + x^k) where lambda(k) is the Liouville function, A008836.

Original entry on oeis.org

1, -3, -2, 5, -4, 6, -6, -11, 7, 12, -10, -10, -12, 18, 8, 21, -16, -21, -18, -20, 12, 30, -22, 22, 21, 36, -20, -30, -28, -24, -30, -43, 20, 48, 24, 35, -36, 54, 24, 44, -40, -36, -42, -50, -28, 66, -46, -42, 43, -63, 32, -60, -52, 60, 40, 66, 36, 84, -58, 40, -60, 90, -42, 85, 48, -60, -66, -80, 44, -72, -70, -77, -72, 108, -42
Offset: 1

Views

Author

Stuart Clary, Apr 15 2006

Keywords

Comments

Related to the logarithmic derivative of A118207(x) and A118208(x).
Related to a signed variant of A022998 via Mobius inversion. - R. J. Mathar, Jul 03 2011

Links

Crossrefs

Cf. A008836, A022998, A028260, A061019, A061020, A062157, A117212, A118207, A118208.

Programs

  • Mathematica
    nmax = 80; lambda[k_Integer?Positive] := If[ k > 1, (-1)^Total[ Part[Transpose[FactorInteger[k]], 2] ], 1 ]; Drop[ CoefficientList[ Series[ Sum[ lambda[k] k x^k/(1 + x^k), {k, 1, nmax} ], {x, 0, nmax} ], x ], 1 ]
f[p_, e_] := (p*(-p)^e+1)/(p+1); f[2, e_] := ((-1)^e*2^(e+2) - 1)/3; a[n_] := Times @@ f @@@ FactorInteger[n]; a[1] = 1; Array[a, 100] (* Amiram Eldar, Aug 12 2023 *)
  • PARI
    a(n) = sumdiv(n, d, (-1)^(n/d - 1)*(-1)^vecsum(factor(d)[,2])*d) \\ Michel Marcus, Dec 10 2016

Formula

a(n) = Sum_{d|n} (-1)^(n/d - 1)*lambda(d)*d, Dirichlet convolution of A061019 and A062157.
G.f.: A(x) is x times the logarithmic derivative of A118207(x).
G.f.: A(x) = A061020(x) - 2 A061020(x^2).
Dirichlet g.f.: zeta(s)*zeta(2s-2)*(1-2^(1-s))/zeta(s-1). - R. J. Mathar, Jul 03 2011
a(n) > 0 for n in A028260. - Michel Marcus, Dec 10 2016
Multiplicative with a(2^e) = ((-1)^e*2^(e+2) - 1)/3, and a(p^e) = (p*(-p)^e+1)/(p+1) for an odd prime p. - Amiram Eldar, Aug 12 2023

A308397 Expansion of e.g.f. exp(Sum_{k>=1} x^(k^2)*(1 - x^(k^2))/k^2).

Original entry on oeis.org

1, 1, -1, -5, 7, 71, -59, -1511, -9295, -1583, 861751, 4039091, -80670281, -606807785, 7674244397, 78614840641, 1146707474401, 12874145737889, -1054507266321425, -19048413877999253, 238097060642380391, 6646823785301856871, -59731575523361439851, -2231444370433747995415
Offset: 0

Views

Author

Ilya Gutkovskiy, May 24 2019

Keywords

Crossrefs

Cf. A008836, A118207, A190585, A205801, A306831, A308396, A308398.

Programs

  • Mathematica
    nmax = 23; CoefficientList[Series[Exp[Sum[x^(k^2) (1 - x^(k^2))/k^2, {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]!
nmax = 23; CoefficientList[Series[Product[(1 + x^k)^(LiouvilleLambda[k]/k), {k, 1, nmax}], {x, 0, nmax}], x] Range[0, nmax]!

Formula

E.g.f.: Product_{k>=1} (1 + x^k)^(lambda(k)/k), where lambda() is the Liouville function (A008836).

A307076 Expansion of 1/(1 - Sum_{k>=1} lambda(k)*x^k), where lambda() is the Liouville function (A008836).

Original entry on oeis.org

1, 1, 0, -2, -2, 0, 4, 4, -2, -10, -6, 10, 22, 4, -34, -46, 16, 102, 86, -100, -272, -126, 370, 650, 60, -1138, -1384, 526, 3142, 2532, -2936, -7952, -3440, 10802, 18426, 596, -33344, -38418, 18716, 91934, 68400, -93402, -230962, -86236, 330144, 528880, -17298, -996040
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 22 2019

Keywords

Comments

Invert transform of A008836.

Crossrefs

Cf. A008836, A118206, A118207, A300663.

Programs

  • Mathematica
    nmax = 47; CoefficientList[Series[1/(1 - Sum[LiouvilleLambda[k] x^k, {k, 1, nmax}]), {x, 0, nmax}], x]
a[0] = 1; a[n_] := a[n] = Sum[LiouvilleLambda[k] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 47}]

Formula

a(0) = 1; a(n) = Sum_{k=1..n} A008836(k)*a(n-k).

A356907 Expansion of 1 / (1 + Sum_{k>=1} lambda(k)*x^k), where lambda() is the Liouville function (A008836).

Original entry on oeis.org

1, -1, 2, -2, 2, 0, -4, 12, -22, 34, -42, 38, -6, -68, 202, -394, 616, -782, 730, -204, -1104, 3486, -6994, 11142, -14452, 14026, -5296, -17558, 60042, -123860, 201128, -266384, 268176, -124034, -273626, 1030396, -2188864, 3624290, -4898740, 5101306, -2744408
Offset: 0

Views

Author

Ilya Gutkovskiy, Oct 02 2022

Keywords

Crossrefs

Cf. A008836, A118205, A118206, A118207, A118208, A185694, A307076, A307240.

Programs

  • Mathematica
    nmax = 40; CoefficientList[Series[1/(1 + Sum[LiouvilleLambda[k] x^k, {k, 1, nmax}]), {x, 0, nmax}], x]
a[0] = 1; a[n_] := a[n] = -Sum[LiouvilleLambda[k] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 40}]

Formula

a(0) = 1; a(n) = -Sum_{k=1..n} A008836(k) * a(n-k).
Showing 1-7 of 7 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.