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

A001482 Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^4 in powers of x.

Original entry on oeis.org

1, -4, 6, -4, -3, 12, -16, 16, -6, -8, 18, -28, 26, -20, 2, 12, -23, 32, -36, 28, -6, 4, 22, -20, 39, -32, 32, -12, 2, 16, -12, 24, -40, 28, -34, 0, -6, -16, 0, -40, 6, -36, 26, -32, -5, 0, -20, 8, -16, 12, -10, 40, -22, 12, 14, 12, 45, 16, 38, 4, 12, 0, 34, 8, 38, 12, -24, 44, 2, 16
Offset: 4

Views

Author

N. J. A. Sloane

Keywords

References

  • H. Gupta, On the coefficients of the powers of Dedekind's modular form, J. London Math. Soc., 39 (1964), 433-440.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Cf. A001483 - A001488, A047638 - A047649, A047654, A047655, A341243.

Programs

  • Magma
    m:=102;
R:=PowerSeriesRing(Integers(), m);
Coefficients(R!( (1 - (&*[1-(-x)^j: j in [1..m+2]]))^4 )); // G. C. Greubel, Sep 04 2023
  • Maple
    g:= proc(n) option remember; `if`(n=0, 1, add(add([-d, d, -2*d, d]
      [1+irem(d, 4)], d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0, g(n)),
      (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 4):
seq(a(n), n=4..73);  # Alois P. Heinz, Feb 07 2021
  • Mathematica
    nmax = 73; CoefficientList[Series[(Product[(1 - (-x)^j), {j, 1, nmax}] - 1)^4, {x, 0, nmax}], x] // Drop[#, 4] & (* Ilya Gutkovskiy, Feb 07 2021 *)
Drop[CoefficientList[Series[(1 -QPochhammer[-x])^4, {x,0,100}], x], 4] (* G. C. Greubel, Sep 04 2023 *)
  • PARI
    my(N=70,x='x+O('x^N)); Vec((eta(-x)-1)^4) \\ Joerg Arndt, Sep 04 2023
  • SageMath
    m=100
def f4(x): return (1 - product( (1+x^j)*(1-x^(2*j))/(1+x^(2*j)) for j in range(1,m+2) ) )^4
def A001482_list(prec):
    P. = PowerSeriesRing(QQ, prec)
    return P( f4(x) ).list()
a=A001482_list(m); a[4:] # G. C. Greubel, Sep 04 2023

Extensions

Definition and offset edited by Ilya Gutkovskiy, Feb 07 2021

A341244 Expansion of (-1 + Product_{k>=1} 1 / (1 + (-x)^k))^5.

Original entry on oeis.org

1, 0, 5, 5, 15, 25, 45, 80, 125, 210, 321, 500, 745, 1110, 1620, 2326, 3315, 4660, 6500, 8955, 12261, 16640, 22425, 29990, 39870, 52701, 69230, 90460, 117620, 152225, 196066, 251455, 321195, 408710, 518060, 654317, 823690, 1033535, 1292690, 1611970, 2004462, 2485605
Offset: 5

Views

Author

Ilya Gutkovskiy, Feb 07 2021

Keywords

Crossrefs

Cf. A000700, A001483, A022600, A327383, A338463, A341223, A341241, A341243, A341245, A341246, A341247, A341251.

Programs

  • Maple
    g:= proc(n) option remember; `if`(n=0, 1, add(add([0, d, -d, d]
      [1+irem(d, 4)], d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
    end:
b:= proc(n, k) option remember; `if`(k<2, `if`(n=0, 1-k, g(n)),
      (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2)))
    end:
a:= n-> b(n, 5):
seq(a(n), n=5..46);  # Alois P. Heinz, Feb 07 2021
  • Mathematica
    nmax = 46; CoefficientList[Series[(-1 + Product[1/(1 + (-x)^k), {k, 1, nmax}])^5, {x, 0, nmax}], x] // Drop[#, 5] &

Formula

G.f.: (-1 + Product_{k>=1} (1 + x^(2*k - 1)))^5.

A001484 Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^6 in powers of x.

Original entry on oeis.org

1, -6, 15, -20, 9, 24, -65, 90, -75, 6, 90, -180, 220, -180, 66, 110, -264, 360, -365, 264, -66, -178, 375, -510, 496, -414, 180, 60, -330, 570, -622, 582, -390, 220, 96, -300, 621, -630, 705, -492, 300, 0, -235, 420, -570, 594, -735, 420, -420, -120, 219, -586, 360
Offset: 6

Views

Author

N. J. A. Sloane

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Cf. A001482, A001483, A001485 - A001488, A047638 - A047649, A047654, A047655, A341243.

Programs

  • Magma
    m:=102;
R:=PowerSeriesRing(Integers(), m);
Coefficients(R!( ((&*[1-(-x)^j: j in [1..m+2]]) -1)^6 )); // G. C. Greubel, Sep 04 2023
  • Maple
    N:= 100:
S:= series((mul(1-(-x)^j,j=1..N)-1)^6,x,N+1):
seq(coeff(S,x,j),j=6..N); # Robert Israel, Feb 05 2019
  • Mathematica
    Drop[CoefficientList[Series[(QPochhammer[-x] -1)^6, {x,0,102}], x], 6] (* G. C. Greubel, Sep 04 2023 *)
  • PARI
    my(N=70,x='x+O('x^N)); Vec((eta(-x)-1)^6) \\ Joerg Arndt, Sep 04 2023
  • SageMath
    m=100; k=6;
def f(k,x): return (-1 + product( (1+x^j)*(1-x^(2*j))/(1+x^(2*j)) for j in range(1,m+2) ) )^k
def A001484_list(prec):
    P. = PowerSeriesRing(QQ, prec)
    return P( f(k,x) ).list()
a=A001484_list(m); a[k:] # G. C. Greubel, Sep 04 2023

Formula

a(n) = [x^n] ( QPochhammer(-x) - 1 )^6. - G. C. Greubel, Sep 04 2023

Extensions

Edited by Robert Israel, Feb 05 2019

A001485 Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^7 in powers of x.

Original entry on oeis.org

1, -7, 21, -35, 28, 21, -105, 181, -189, 77, 140, -385, 546, -511, 252, 203, -693, 1029, -1092, 798, -203, -581, 1281, -1708, 1687, -1232, 413, 602, -1485, 2233, -2366, 2009, -1099, 14, 1099, -2072, 2667, -2807, 2254, -1477, 0, 1057, -2346, 2744, -3017, 2457
Offset: 7

Views

Author

N. J. A. Sloane

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Cf. A001482, A001483, A001484, A001486, A001487, A001488, A047638 - A047649, A047654, A047655, A341243.

Programs

  • Magma
    m:=102;
R:=PowerSeriesRing(Integers(), m);
Coefficients(R!( ((&*[1-(-x)^j: j in [1..m+2]]) -1)^7 )); // G. C. Greubel, Sep 04 2023
  • Maple
    g:= proc(n) option remember; `if`(n=0, 1, add(add([-d, d, -2*d, d]
      [1+irem(d, 4)], d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0, g(n)),
      (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 7):
seq(a(n), n=7..52);  # Alois P. Heinz, Feb 07 2021
  • Mathematica
    nmax = 52; CoefficientList[Series[(Product[(1 - (-x)^j), {j, 1, nmax}] - 1)^7, {x, 0, nmax}], x] // Drop[#, 7] & (* Ilya Gutkovskiy, Feb 07 2021 *)
Drop[CoefficientList[Series[(QPochhammer[-x] -1)^7, {x,0,102}], x], 7] (* G. C. Greubel, Sep 04 2023 *)
  • PARI
    my(N=70,x='x+O('x^N)); Vec((eta(-x)-1)^7) \\ Joerg Arndt, Sep 04 2023
  • SageMath
    m=100; k=7;
def f(k,x): return (-1 + product( (1+x^j)*(1-x^(2*j))/(1+x^(2*j)) for j in range(1,m+2) ) )^k
def A001485_list(prec):
    P. = PowerSeriesRing(QQ, prec)
    return P( f(k,x) ).list()
a=A001485_list(m); a[k:] # G. C. Greubel, Sep 04 2023

Formula

a(n) = [x^n] ( QPochhammer(-x) - 1 )^7. - G. C. Greubel, Sep 04 2023

Extensions

Definition and offset edited by Ilya Gutkovskiy, Feb 07 2021

A341263 Coefficient of x^(2*n) in (-1 + Product_{k>=1} (1 - x^k))^n.

Original entry on oeis.org

1, -1, 1, -1, -3, 19, -65, 181, -419, 755, -749, -1530, 12255, -47477, 141065, -343526, 660941, -770917, -911369, 9721976, -40135713, 124134772, -313463842, 631382751, -824406065, -492101356, 8192253811, -35948431288, 115087580857, -299576625051, 627027769120, -894734468883
Offset: 0

Views

Author

Ilya Gutkovskiy, Feb 07 2021

Keywords

Crossrefs

Cf. A001482, A001483, A001484, A001485, A001486, A001487, A001488, A008705, A010815, A047654, A047655, A324595, A340987, A341265.

Programs

  • Maple
    g:= proc(n) option remember; `if`(n=0, 1, add(add(
     -d, d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, g(n+1),
      (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..31);  # Alois P. Heinz, Feb 07 2021
  • Mathematica
    Table[SeriesCoefficient[(-1 + QPochhammer[x, x])^n, {x, 0, 2 n}], {n, 0, 31}]
A[n_, k_] := A[n, k] = If[n == 0, 1, -k Sum[A[n - j, k] DivisorSigma[1, j], {j, 1, n}]/n]; T[n_, k_] := Sum[(-1)^i Binomial[k, i] A[n, k - i], {i, 0, k}];
Table[T[2 n, n], {n, 0, 31}]
Showing 1-5 of 5 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.