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-10 of 12 results. Next

A318204 Decimal expansion of a constant related to the asymptotics of A255526.

Original entry on oeis.org

3, 5, 0, 9, 7, 5, 4, 3, 2, 7, 9, 4, 9, 7, 0, 3, 3, 4, 0, 4, 3, 7, 2, 7, 3, 5, 2, 3, 3, 7, 5, 1, 9, 3, 6, 9, 8, 4, 5, 4, 7, 8, 9, 7, 3, 3, 9, 3, 1, 7, 3, 9, 9, 1, 1, 7, 8, 9, 8, 9, 9, 3, 7, 8, 5, 8, 5, 4, 8, 2, 1, 7, 0, 1, 5, 1, 2, 0, 0, 7, 7, 4, 4, 5, 6, 4, 8, 9, 4, 0, 8, 1, 3, 0, 7, 5, 1, 2, 1, 3, 2, 6, 4, 0, 2
Offset: 1

Views

Author

Vaclav Kotesovec, Aug 21 2018

Keywords

Examples

			3.509754327949703340437273523375193698454789733931739911...
		

Crossrefs

Programs

  • Mathematica
    RealDigits[1/r /. FindRoot[{2*r == s*QPochhammer[-1, -s], 2*r == s^2*Derivative[0, 1][QPochhammer][-1, -s]}, {r, 1/3}, {s, 1/2}, WorkingPrecision -> 120], 10, 105][[1]] (* Vaclav Kotesovec, Oct 03 2023 *)

A008485 Coefficient of x^n in Product_{k>=1} 1/(1-x^k)^n.

Original entry on oeis.org

1, 1, 5, 22, 105, 506, 2492, 12405, 62337, 315445, 1605340, 8207563, 42124380, 216903064, 1119974875, 5796944357, 30068145905, 156250892610, 813310723925, 4239676354650, 22130265931900, 115654632452535, 605081974091875, 3168828466966388, 16610409114771900
Offset: 0

Views

Author

T. Forbes (anthony.d.forbes(AT)googlemail.com)

Keywords

Comments

Number of partitions of n into parts of n kinds. - Vladeta Jovovic, Sep 08 2002
Main diagonal of A144064. - Omar E. Pol, Jun 27 2012
From Peter Bala, Apr 18 2023: (Start)
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p and all positive integers n and k.
Conjecture: the supercongruence a(p) == p + 1 (mod p^2) holds for all primes p >= 3. Cf. A270913. (End)

Crossrefs

Programs

  • Maple
    with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; `if`(n=0, 1, add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n) end end: a:= n-> etr(j->n)(n): seq(a(n), n=0..30); # Alois P. Heinz, Sep 09 2008
  • Mathematica
    a[n_] := SeriesCoefficient[ Product[1/(1-x^k)^n, {k, 1, n}], {x, 0, n}]; a[1] = 1; Table[a[n], {n, 1, 24}] (* Jean-François Alcover, Feb 24 2015 *)
    Table[SeriesCoefficient[1/QPochhammer[x, x]^n, {x, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Mar 25 2016 *)
    Table[SeriesCoefficient[Exp[n*Sum[x^j/(j*(1-x^j)), {j, 1, n}]], {x, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, May 19 2018 *)
  • PARI
    {a(n)=polcoeff(prod(k=1,n,1/(1-x^k +x*O(x^n))^n),n)}
    
  • PARI
    {a(n)=n*polcoeff(log(1/x*serreverse(x*eta(x+x*O(x^n)))), n)} /* Paul D. Hanna, Apr 05 2012 */

Formula

a(n) = Sum_{pi} Product_{i=1..n} binomial(k_i+n-1, k_i) where pi runs through all nonnegative solutions of k_1+2*k_2+...+n*k_n=n. a(n) = b(n, n) where b(n, m)= m/n*Sum_{i=1..n} sigma(i)*b(n-i, m) is recurrence for number of partitions of n into parts of m kinds. - Vladeta Jovovic, Sep 08 2002
Equals the logarithmic derivative of A109085, the g.f. of which is (1/x)*Series_Reversion(x*eta(x)). - Paul D. Hanna, Apr 05 2012
Let G(x) = exp( Sum_{n>=1} a(n)*x^n/n ), then G(x) = 1/Product_{n>=1} (1-x^n*G(x)^n) is the g.f. of A109085. - Paul D. Hanna, Apr 05 2012
a(n) ~ c * d^n / sqrt(n), where d = A270915 = 5.352701333486642687772415814165..., c = A327279 = 0.26801521271073331568695383828... . - Vaclav Kotesovec, Sep 10 2014

Extensions

a(0)=1 prepended by Alois P. Heinz, Mar 30 2015

A270913 Coefficient of x^n in Product_{k>=1} (1+x^k)^n.

Original entry on oeis.org

1, 1, 3, 13, 51, 206, 855, 3585, 15155, 64525, 276278, 1188353, 5130999, 22226049, 96544003, 420368858, 1834203955, 8018057345, 35107961175, 153950675585, 675978772326, 2971700764941, 13078268135683, 57613905606273, 254038914924791, 1121081799217231
Offset: 0

Views

Author

Vaclav Kotesovec, Mar 25 2016

Keywords

Comments

From Peter Bala, Apr 18 2023: (Start)
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p and all positive integers n and k.
Conjecture: the supercongruence a(p) == p + 1 (mod p^2) holds for all primes p. (End)

Crossrefs

Programs

  • Maple
    b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(
         `if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
        end:
    g:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, b(n),
           (q-> add(g(j, q)*g(n-j, k-q), j=0..n))(iquo(k, 2))))
        end:
    a:= n-> g(n$2):
    seq(a(n), n=0..25);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    Table[SeriesCoefficient[Product[(1+x^k)^n, {k, 1, n}], {x, 0, n}], {n, 0, 25}]
    Table[SeriesCoefficient[QPochhammer[-1, x]^n, {x, 0, n}]/2^n, {n, 0, 25}]
    Table[SeriesCoefficient[Exp[n*Sum[(-1)^j*x^j/(j*(x^j - 1)), {j, 1, n}]], {x, 0, n}], {n, 0, 25}] (* Vaclav Kotesovec, May 19 2018 *)
  • PARI
    {a(n)=polcoeff(prod(k=1, n, (1 + x^k +x*O(x^n))^n), n)}
    for(n=0, 20, print1(a(n), ", ")) \\ Vaclav Kotesovec, Aug 26 2019

Formula

a(n) ~ c * d^n / sqrt(n), where d = A270914 = 4.5024767476173544877385939327007... and c = A327280 = 0.260542233142438469433860832160...

A286352 Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of Product_{j>=1} 1/(1 + x^j)^k.

Original entry on oeis.org

1, 1, 0, 1, -1, 0, 1, -2, 0, 0, 1, -3, 1, -1, 0, 1, -4, 3, -2, 1, 0, 1, -5, 6, -4, 4, -1, 0, 1, -6, 10, -8, 9, -4, 1, 0, 1, -7, 15, -15, 17, -12, 5, -1, 0, 1, -8, 21, -26, 30, -28, 15, -6, 2, 0, 1, -9, 28, -42, 51, -56, 38, -21, 9, -2, 0, 1, -10, 36, -64, 84
Offset: 0

Views

Author

Seiichi Manyama, May 08 2017

Keywords

Examples

			Square array begins:
   1,  1,  1,  1,  1,   1, ...
   0, -1, -2, -3, -4,  -5, ...
   0,  0,  1,  3,  6,  10, ...
   0, -1, -2, -4, -8, -15, ...
   0,  1,  4,  9, 17,  30, ...
		

Crossrefs

Columns k=0-32 give: A000007, A081362, A022597-A022627.
Main diagonal gives A255526.
Antidiagonal sums give A299208.
Cf. A286335.

Formula

G.f. of column k: Product_{j>=1} 1/(1 + x^j)^k.

A278428 Series reversion of g.f. (1/2)*x*(-1; -x)_inf, where (a; q)_inf is the q-Pochhammer symbol.

Original entry on oeis.org

1, 1, 1, 2, 6, 17, 46, 128, 373, 1119, 3405, 10464, 32478, 101781, 321642, 1023512, 3276326, 10543100, 34088806, 110690682, 360810160, 1180195810, 3872588051, 12743937024, 42049240694, 139082885503, 461072582522, 1531697761470, 5098246648103, 17000237006441
Offset: 1

Views

Author

Vladimir Reshetnikov, Nov 21 2016

Keywords

Comments

(1/2)*x*(-1; -x)_inf is the g.f. for A081360 shifted right.

Crossrefs

Programs

  • Mathematica
    InverseSeries[x QPochhammer[-1, -x]/2 + O[x]^35][[3]]
    (* Calculation of constant c: *) 1/Sqrt[(4/s^2 - s*Derivative[0, 2][QPochhammer][-1, -s]/r) * Pi] /. FindRoot[{2*r == s*QPochhammer[-1, -s], 2*r == s^2*Derivative[0, 1][QPochhammer][-1, -s]}, {r, 1/3}, {s, 1/2}, WorkingPrecision -> 120] (* Vaclav Kotesovec, Oct 03 2023 *)

Formula

a(n) ~ c * d^n / n^(3/2), where c = 0.1211369424750398272226454930396... and d = A318204 = 3.509754327949703340437273523375193698454789733931739911... - Vaclav Kotesovec, Nov 23 2016

A303174 a(n) = [x^n] Product_{k=1..n} 1/(1 + x^k)^(n-k+1).

Original entry on oeis.org

1, -1, 2, -5, 18, -60, 189, -601, 1967, -6544, 21872, -73247, 246080, -829924, 2808357, -9527485, 32389671, -110316862, 376372802, -1286063899, 4400499380, -15075608840, 51704898623, -177513230200, 610007283817, -2098029341745, 7221561430933, -24875274224531
Offset: 0

Views

Author

Ilya Gutkovskiy, Apr 19 2018

Keywords

Examples

			a(0) = 1;
a(1) = [x^1] 1/(1 + x) = -1;
a(2) = [x^2] 1/((1 + x)^2*(1 + x^2)) = 2;
a(3) = [x^3] 1/((1 + x)^3*(1 + x^2)^2*(1 + x^3)) = -5;
a(4) = [x^4] 1/((1 + x)^4*(1 + x^2)^3*(1 + x^3)^2*(1 + x^4)) = 18;
a(5) = [x^5] 1/((1 + x)^5*(1 + x^2)^4*(1 + x^3)^3*(1 + x^4)^2*(1 + x^5)) = -60, etc.
...
The table of coefficients of x^k in expansion of Product_{k=1..n} 1/(1 + x^k)^(n-k+1) begins:
n = 0: (1),  0,   0,    0,   0,    0,  ...
n = 1:  1, (-1),  1,   -1,   1,   -1,  ...
n = 2:  1,  -2,  (2),  -2,   3,   -4,  ...
n = 3:  1,  -3,   4,  (-5),  9,  -14,  ...
n = 4:  1,  -4,   7,  -10, (18), -30,  ...
n = 5:  1,  -5,  11,  -18,  33, (-60), ...
		

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[Product[1/(1 + x^k)^(n - k + 1), {k, 1, n}], {x, 0, n}], {n, 0, 27}]

Formula

a(n) ~ (-1)^n * c * d^n / sqrt(n), where d = A318204 = 3.50975432794970334043727352337... and c = 0.2457469629428839220188283... - Vaclav Kotesovec, Aug 21 2018

A296164 a(n) = [x^n] Product_{k>=1} ((1 + x^k)/(1 + x^(3*k)))^n.

Original entry on oeis.org

1, 1, 3, 10, 35, 131, 498, 1919, 7459, 29170, 114653, 452552, 1792754, 7124040, 28386081, 113372690, 453743907, 1819317153, 7306575042, 29386858821, 118348662525, 477188876405, 1926137365804, 7782398551661, 31472648050930, 127384123318906, 515978637418884
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 06 2017

Keywords

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[Product[((1 + x^k)/(1 + x^(3 k)))^n, {k, 1, n}], {x, 0, n}], {n, 0, 26}]
    Table[SeriesCoefficient[Product[1/((1 - x^(6 k - 1)) (1 - x^(6 k - 5)))^n, {k, 1, n}], {x, 0, n}], {n, 0, 26}]
    (* Calculation of constants {d,c}: *) With[{k = 3}, {1/r, Sqrt[QPochhammer[-1, (r*s)^k] / (2*Pi*(r^2*s*Derivative[0, 2][QPochhammer][-1, r*s] - k^2*(r*s)^(2*k) * Derivative[0, 2][QPochhammer][-1, (r*s)^k] - k*(1 + k)*(r*s)^k * Derivative[0, 1][QPochhammer][-1, (r*s)^k]))]} /. FindRoot[{s == QPochhammer[-1, r*s]/QPochhammer[-1, (r*s)^k], QPochhammer[-1, (r*s)^k] + k*(r*s)^k*Derivative[0, 1][QPochhammer][-1, (r*s)^k] == r*Derivative[0, 1][QPochhammer][-1, r*s]}, {r, 1/4}, {s, 2}, WorkingPrecision -> 70]] (* Vaclav Kotesovec, Jan 17 2024 *)

Formula

a(n) = [x^n] Product_{k>=1} 1/((1 - x^(6*k-1))*(1 - x^(6*k-5)))^n.
a(n) ~ c * d^n / sqrt(n), where d = 4.129321588075726742506... and c = 0.25764349816429874321... - Vaclav Kotesovec, May 18 2018

A304626 a(n) = [x^n] Product_{k>=1} ((1 + x^k)/(1 + x^(n*k)))^n.

Original entry on oeis.org

1, 0, 1, 10, 47, 201, 849, 3578, 15147, 64516, 276268, 1188342, 5130987, 22226036, 96543989, 420368843, 1834203939, 8018057328, 35107961157, 153950675566, 675978772306, 2971700764920, 13078268135661, 57613905606250, 254038914924767, 1121081799217206, 4951199308679965
Offset: 0

Views

Author

Ilya Gutkovskiy, May 15 2018

Keywords

Comments

Number of partitions of n into 2 or more distinct parts, with n types of each part. - Ilya Gutkovskiy, May 16 2018

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[Product[((1 + x^k)/(1 + x^(n k)))^n, {k, 1, n}], {x, 0, n}], {n, 0, 26}]
    Table[SeriesCoefficient[Product[(1 + x^k)^n, {k, 1, n - 1}], {x, 0, n}], {n, 0, 26}]
    Table[SeriesCoefficient[(QPochhammer[-1, x, 1 + n]/QPochhammer[-1, x^n, 1 + n])^n, {x, 0, n}], {n, 0, 26}]

Formula

a(n) ~ c * d^n / sqrt(n), where d = A270914 = 4.502476747617354487738... and c = 0.2605422331424384694... - Vaclav Kotesovec, May 16 2018

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

Original entry on oeis.org

1, 0, 2, 3, 10, 25, 71, 203, 562, 1650, 4667, 13673, 39427, 115440, 336639, 987628, 2898658, 8529257, 25134200, 74173606, 219207815, 648546314, 1921045953, 5695642513, 16902924883, 50203798050, 149229323544, 443895849894, 1321292939459, 3935377071154, 11728037768186
Offset: 0

Views

Author

Ilya Gutkovskiy, Feb 07 2021

Keywords

Crossrefs

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=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..30);  # Alois P. Heinz, Feb 07 2021
  • Mathematica
    Table[SeriesCoefficient[(-1 + 1/QPochhammer[-x, x])^n, {x, 0, 2 n}], {n, 0, 30}]
    A[n_, k_] := A[n, k] = If[n == 0, 1, -k Sum[A[n - j, k] Sum[Mod[d, 2] d, {d, Divisors[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, 30}]

Formula

a(n) = A341279(2n,n).
a(n) ~ c * d^n / sqrt(n), where d = 3.03044218957412050685579849718626198523346... and c = 0.2319377657497495246637662111041144... - Vaclav Kotesovec, Feb 20 2021

A300458 a(n) = [x^n] Product_{k=1..n} 1/(1 + x^k)^(n^k).

Original entry on oeis.org

1, -1, -1, -10, 11, 374, 9792, 183847, 3469427, 65038049, 1195396233, 19667738452, 189089161562, -6219720781782, -606316892131934, -35104997710496175, -1795953382595105853, -88223902016631657740, -4283800987347611165184, -207864171877269042498096, -10102590396625592962089500
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 06 2018

Keywords

Examples

			The table of coefficients of x^k in expansion of Product_{k>=1} 1/(1 + x^k)^(n^k) begins:
n = 0: (1),  0,    0,    0,   0,     0,  ...
n = 1:  1, (-1),   0,   -1,   1,    -1,  ...
n = 2:  1,  -2,  (-1),  -4,   3,    -2,  ...
n = 3:  1,  -3,   -3, (-10),  6,    15,  ...
n = 4:  1,  -4,   -6,  -20, (11),  104,  ...
n = 5:  1,  -5,  -10,  -35,  20,  (374), ...
		

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[Product[1/(1 + x^k)^(n^k), {k, 1, n}], {x, 0, n}], {n, 0, 20}]
Showing 1-10 of 12 results. Next