A256142 -id:A256142 - cp's OEIS frontend

A261049 Expansion of Product_{k>=1} (1+x^k)^(p(k)), where p(k) is the partition function.

1, 1, 2, 5, 9, 19, 37, 71, 133, 252, 464, 851, 1547, 2787, 4985, 8862, 15639, 27446, 47909, 83168, 143691, 247109, 423082, 721360, 1225119, 2072762, 3494359, 5870717, 9830702, 16409939, 27309660, 45316753, 74986921, 123748430, 203686778, 334421510, 547735241

Offset: 0

Vaclav Kotesovec, Aug 08 2015

nonn

Number of strict multiset partitions of integer partitions of n. Weigh transform of A000041. - Gus Wiseman, Oct 11 2018

			From _Gus Wiseman_, Oct 11 2018: (Start)
The a(1) = 1 through a(5) = 19 strict multiset partitions:
  {{1}}  {{2}}    {{3}}        {{4}}          {{5}}
         {{1,1}}  {{1,2}}      {{1,3}}        {{1,4}}
                  {{1,1,1}}    {{2,2}}        {{2,3}}
                  {{1},{2}}    {{1,1,2}}      {{1,1,3}}
                  {{1},{1,1}}  {{1},{3}}      {{1,2,2}}
                               {{1,1,1,1}}    {{1},{4}}
                               {{1},{1,2}}    {{2},{3}}
                               {{2},{1,1}}    {{1,1,1,2}}
                               {{1},{1,1,1}}  {{1},{1,3}}
                                              {{1},{2,2}}
                                              {{2},{1,2}}
                                              {{3},{1,1}}
                                              {{1,1,1,1,1}}
                                              {{1},{1,1,2}}
                                              {{1,1},{1,2}}
                                              {{2},{1,1,1}}
                                              {{1},{1,1,1,1}}
                                              {{1,1},{1,1,1}}
                                              {{1},{2},{1,1}}
(End)

Alois P. Heinz, Table of n, a(n) for n = 0..1000
R. Kaneiwa, An asymptotic formula for Cayley's double partition function p(2; n), Tokyo J. Math. 2, 137-158 (1979).

Cf. A000041, A001970, A026007, A027998, A248882, A102866, A256142.
Cf. A047968, A050342, A089259, A305551, A320328, A320330, A320331.
Row sums of A360742.

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
      binomial(combinat[numbpart](i), j)*b(n-i*j, i-1), j=0..n/i)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..40);  # Alois P. Heinz, Aug 08 2015

nmax=40; CoefficientList[Series[Product[(1+x^k)^PartitionsP[k],{k,1,nmax}],{x,0,nmax}],x]

A102866 Number of finite languages over a binary alphabet (set of nonempty binary words of total length n).

Original entry on oeis.org

1, 2, 5, 16, 42, 116, 310, 816, 2121, 5466, 13937, 35248, 88494, 220644, 546778, 1347344, 3302780, 8057344, 19568892, 47329264, 114025786, 273709732, 654765342, 1561257968, 3711373005, 8797021714, 20794198581, 49024480880, 115292809910, 270495295636

Offset: 0

Philippe Flajolet, Mar 01 2005

nonn

Analogous to A034899 (which also enumerates multisets of words)

			a(2) = 5 because the sets are {a,b}, {aa}, {ab}, {ba}, {bb}.
a(3) = 16 because the sets are {a,aa}, {a,ab}, {a,ba}, {a,bb}, {b,aa}, {b,ab}, {b,ba}, {b,bb}, {aaa}, {aab}, {aba}, {abb}, {baa}, {bab}, {bba}, {bbb}.

Alois P. Heinz, Table of n, a(n) for n = 0..1000
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 64
Stefan Gerhold, Counting finite languages by total word length, INTEGERS 11 (2011), #A44.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 27.

Cf. A000079, A034899, A256142.
Column k=2 of A292804.
Row sums of A208741 and of A360634.

series(exp(add((-1)^(j-1)/j*(2*z^j)/(1-2*z^j),j=1..40)),z,40);

nn = 20; p = Product[(1 + x^i)^(2^i), {i, 1, nn}]; CoefficientList[Series[p, {x, 0, nn}], x] (* Geoffrey Critzer, Mar 07 2012 *)
CoefficientList[Series[E^Sum[(-1)^(k-1)/k*(2*x^k)/(1-2*x^k), {k,1,30}], {x, 0, 30}], x] (* Vaclav Kotesovec, Sep 13 2014 *)

G.f.: exp(Sum((-1)^(j-1)/j*(2*z^j)/(1-2*z^j), j=1..infinity)).
Asymptotics (Gerhold, 2011): a(n) ~ c * 2^(n-1)*exp(2*sqrt(n)-1/2) / (sqrt(Pi) * n^(3/4)), where c = exp( Sum_{k>=2} (-1)^(k-1)/(k*(2^(k-1)-1)) ) = 0.6602994483152065685... . - Vaclav Kotesovec, Sep 13 2014
Weigh transform of A000079. - Alois P. Heinz, Jun 25 2018

A144074 Number A(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 7, 3, 0, 1, 4, 15, 20, 5, 0, 1, 5, 26, 64, 59, 7, 0, 1, 6, 40, 148, 276, 162, 11, 0, 1, 7, 57, 285, 843, 1137, 449, 15, 0, 1, 8, 77, 488, 2020, 4632, 4648, 1200, 22, 0, 1, 9, 100, 770, 4140, 13876, 25124, 18585, 3194, 30, 0, 1, 10, 126

Offset: 0

Alois P. Heinz, Sep 09 2008

Column k > 1 is asymptotic to k^n * exp(2*sqrt(n) - 1/2 + c(k)) / (2 * sqrt(Pi) * n^(3/4)), where c(k) = Sum_{m>=2} 1/(m*(k^(m-1)-1)). - Vaclav Kotesovec, Mar 14 2015

			A(4,1) = 5: {aaaa}, {aaa,a}, {aa,aa}, {aa,a,a}, {a,a,a,a}.
A(2,2) = 7: {aa}, {a,a}, {bb}, {b,b}, {ab}, {ba}, {a,b}.
A(2,3) = 15: {aa}, {a,a}, {bb}, {b,b}, {cc}, {c,c}, {ab}, {ba}, {a,b}, {ac}, {ca}, {a,c}, {bc}, {cb}, {b,c}.
A(3,2) = 20: {aaa}, {a,aa}, {a,a,a}, {bbb}, {b,bb}, {b,b,b}, {aab}, {aba}, {baa}, {a,ab}, {a,ba}, {aa,b}, {a,a,b}, {bba}, {bab}, {abb}, {b,ba}, {b,ab}, {bb,a}, {b,b,a}.
Square array begins:
  1, 1,   1,    1,    1,     1, ...
  0, 1,   2,    3,    4,     5, ...
  0, 2,   7,   15,   26,    40, ...
  0, 3,  20,   64,  148,   285, ...
  0, 5,  59,  276,  843,  2020, ...
  0, 7, 162, 1137, 4632, 13876, ...

Alois P. Heinz, Antidiagonals n = 0..140, flattened
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 27.
N. J. A. Sloane, Transforms

Columns k=0-10 give: A000007, A000041, A034899, A144067, A144068, A144069, A144070, A144071, A144072, A144073, A292837.
Rows n=0-2 give: A000012, A001477, A005449.
Main diagonal gives A252654.
Cf. A004248, A257740, A256142, A292804.

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,k)-> etr(j->k^j)(n); seq(seq(A(n, d-n), n=0..d), d=0..14);

a[n_, k_] := SeriesCoefficient[ Product[1/(1-x^j)^(k^j), {j, 1, n}], {x, 0, n}]; a[0, ] = 1; a[?Positive, 0] = 0;
Table[a[n-k, k], {n, 0, 14}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Jan 15 2014 *)
etr[p_] := Module[{b}, b[n_] := b[n] = If[n==0, 1, Sum[Sum[d p[d], {d, Divisors[j]}] b[n-j], {j, 1, n}]/n]; b];
A[n_, k_] := etr[k^#&][n];
Table[Table[A[n, d-n], {n, 0, d}], {d, 0, 14}] // Flatten (* Jean-François Alcover, Dec 30 2020, after Alois P. Heinz *)

G.f. of column k: Product_{j>=1} 1/(1-x^j)^(k^j).
Column k is Euler transform of the powers of k.
T(n,k) = Sum_{i=0..k} C(k,i) * A257740(n,k-i). - Alois P. Heinz, May 08 2015

Name changed by Alois P. Heinz, Sep 21 2018

A292804 Number A(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 5, 2, 0, 1, 4, 12, 16, 2, 0, 1, 5, 22, 55, 42, 3, 0, 1, 6, 35, 132, 225, 116, 4, 0, 1, 7, 51, 260, 729, 927, 310, 5, 0, 1, 8, 70, 452, 1805, 4000, 3729, 816, 6, 0, 1, 9, 92, 721, 3777, 12376, 21488, 14787, 2121, 8, 0

Offset: 0

Alois P. Heinz, Sep 23 2017

			A(2,2) = 5: {aa}, {ab}, {ba}, {bb}, {a,b}.
Square array A(n,k) begins:
  1, 1,   1,     1,      1,      1,       1,       1, ...
  0, 1,   2,     3,      4,      5,       6,       7, ...
  0, 1,   5,    12,     22,     35,      51,      70, ...
  0, 2,  16,    55,    132,    260,     452,     721, ...
  0, 2,  42,   225,    729,   1805,    3777,    7042, ...
  0, 3, 116,   927,   4000,  12376,   31074,   67592, ...
  0, 4, 310,  3729,  21488,  83175,  250735,  636517, ...
  0, 5, 816, 14787, 113760, 550775, 1993176, 5904746, ...

Alois P. Heinz, Antidiagonals n = 0..140, flattened

Columns k=0-10 give: A000007, A000009, A102866, A256142, A292838, A292839, A292840, A292841, A292842, A292843, A292844.
Rows n=0-2 give: A000012, A001477, A000326.
Main diagonal gives A292805.
Cf. A144074, A292795, A319501.

h:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,
      add(h(n-i*j, i-1, k)*binomial(k^i, j), j=0..n/i)))
    end:
A:= (n, k)-> h(n$2, k):
seq(seq(A(n, d-n), n=0..d), d=0..14);

h[n_, i_, k_] := h[n, i, k] = If[n==0, 1, If[i<1, 0, Sum[h[n-i*j, i-1, k]* Binomial[k^i, j], {j, 0, n/i}]]];
A[n_, k_] := h[n, n, k];
Table[A[n, d-n], {d, 0, 14}, {n, 0, d}] // Flatten (* Jean-François Alcover, Jun 03 2018, from Maple *)

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

A(n,k) = Sum_{i=0..k} C(k,i) * A319501(n,i).

A261050 Expansion of Product_{k>=1} (1+x^k)^(Fibonacci(k)).

Original entry on oeis.org

1, 1, 1, 3, 5, 10, 19, 36, 67, 127, 236, 438, 811, 1496, 2750, 5046, 9224, 16827, 30630, 55623, 100803, 182342, 329205, 593326, 1067591, 1917885, 3440207, 6162004, 11021921, 19688757, 35126020, 62590629, 111398910, 198044551, 351700332, 623918086, 1105715149

Offset: 0

Vaclav Kotesovec, Aug 08 2015

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
Vaclav Kotesovec, Asymptotics of the Euler transform of Fibonacci numbers, arXiv:1508.01796 [math.CO], Aug 07 2015

Cf. A000045, A166861, A261051, A026007, A027998, A248882, A102866, A256142, A260916.

f:= proc(n) option remember; (<<1|1>, <1|0>>^n)[1, 2] end:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
       add(binomial(f(i), j)*b(n-i*j, i-1), j=0..n/i)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..50);  # Alois P. Heinz, Aug 08 2015

nmax=40; CoefficientList[Series[Product[(1+x^k)^Fibonacci[k],{k,1,nmax}],{x,0,nmax}],x]

a(n) ~ phi^n / (2 * sqrt(Pi) * 5^(1/8) * n^(3/4)) * exp(-1/10 + 2*5^(-1/4)*sqrt(n) + s), where s = Sum_{k>=2} (-1)^(k+1) * phi^k / ((phi^(2*k) - phi^k - 1)*k) = -0.3237251774053525012502809827680337358578568068831886835557918847... and phi = A001622 = (1+sqrt(5))/2 is the golden ratio.

G.f.: exp(Sum_{k>=1} (-1)^(k+1)*x^k/(k*(1 - x^k - x^(2*k)))). - Ilya Gutkovskiy, May 29 2018

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

Original entry on oeis.org

1, 6, 36, 200, 1038, 5160, 24776, 115632, 527172, 2355998, 10349448, 44783064, 191211512, 806737800, 3367294320, 13918479872, 57020736942, 231697484304, 934399998412, 3742041461976, 14888854356840, 58881590423856, 231542984619720, 905666813058384

Offset: 0

Vaclav Kotesovec, Aug 23 2015

nonn

Convolution of A144067 and A256142.

In general, for m > 1, if g.f. = Product_{k>=1} ((1+x^k)/(1-x^k))^(m^k), then a(n) ~ m^n * exp(2*sqrt(2*n) - 1 + c) / (sqrt(Pi) * 2^(3/4) * n^(3/4)), where c = 2 * Sum_{j>=1} 1/((2*j+1)*(m^(2*j)-1)).

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
Vaclav Kotesovec, Asymptotics of the Euler transform of Fibonacci numbers, arXiv:1508.01796 [math.CO]
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 27.

Cf. A156616, A261519, A260916, A001934, A015128.

nmax = 40; CoefficientList[Series[Product[((1 + x^k)/(1 - x^k))^(3^k), {k, 1, nmax}], {x, 0, nmax}], x]

a(n) ~ 3^n * exp(2*sqrt(2*n) - 1 + c) / (sqrt(Pi) * 2^(3/4) * n^(3/4)), where c = 2 * Sum_{j>=1} 1/((2*j+1)*(3^(2*j)-1)) = 0.0887630729103166089354170592729856346...

A261053 Expansion of Product_{k>=1} (1+x^k)^(k^k).

Original entry on oeis.org

1, 1, 4, 31, 289, 3495, 51268, 891152, 17926913, 409907600, 10499834497, 297793199060, 9262502810645, 313457634240463, 11464902463397642, 450646709610954343, 18943070964019019671, 847932498252050293971, 40266255926484893366914, 2021845081107882645459639

Offset: 0

Vaclav Kotesovec, Aug 08 2015

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..385

Cf. A023880, A261052, A026007, A027998, A248882, A102866, A256142.

m:=20; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&*[(1+x^k)^(k^k): k in [1..(m+2)]]))); // G. C. Greubel, Nov 08 2018

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      add(binomial(i^i, j)*b(n-i*j, i-1), j=0..n/i)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..25);  # Alois P. Heinz, Aug 08 2015

nmax=20; CoefficientList[Series[Product[(1+x^k)^(k^k),{k,1,nmax}],{x,0,nmax}],x]

m=20; x='x+O('x^m); Vec(prod(k=1,m, (1+x^k)^(k^k))) \\ G. C. Greubel, Nov 08 2018

a(n) ~ n^n * (1 + exp(-1)/n + (exp(-1)/2 + 4*exp(-2))/n^2).

G.f.: exp(Sum_{k>=1} ( Sum_{d|k} (-1)^(k/d+1)*d^(d+1) ) * x^k/k). - Ilya Gutkovskiy, Nov 08 2018

A343360 Expansion of Product_{k>=1} (1 + x^k)^(3^(k-1)).

Original entry on oeis.org

1, 1, 3, 12, 39, 138, 469, 1603, 5427, 18372, 61869, 207909, 696537, 2328039, 7762266, 25826142, 85749969, 284171598, 940027872, 3104280885, 10234808334, 33692547249, 110753171784, 363561071175, 1191860487561, 3902350627434, 12761565487173, 41685086306917, 136012008938158

Offset: 0

Ilya Gutkovskiy, Apr 12 2021

nonn

Cf. A098407, A104460, A256142, A343361, A343362, A343363, A343364, A343365, A343366.

h:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      add(h(n-i*j, i-1)*binomial(3^(i-1), j), j=0..n/i)))
    end:
a:= n-> h(n$2):
seq(a(n), n=0..28);  # Alois P. Heinz, Apr 12 2021

nmax = 28; CoefficientList[Series[Product[(1 + x^k)^(3^(k - 1)), {k, 1, nmax}], {x, 0, nmax}], x]
a[n_] := a[n] = If[n == 0, 1, (1/n) Sum[Sum[(-1)^(k/d + 1) d 3^(d - 1), {d, Divisors[k]}] a[n - k], {k, 1, n}]]; Table[a[n], {n, 0, 28}]

seq(n)={Vec(prod(k=1, n, (1 + x^k + O(x*x^n))^(3^(k-1))))} \\ Andrew Howroyd, Apr 12 2021

a(n) ~ exp(2*sqrt(n/3) - 1/6 - c/3) * 3^(n - 1/4) / (2*sqrt(Pi)*n^(3/4)), where c = Sum_{j>=2} (-1)^j / (j * (3^(j-1) - 1)). - Vaclav Kotesovec, Apr 13 2021

A144067 Euler transform of powers of 3.

Original entry on oeis.org

1, 3, 15, 64, 276, 1137, 4648, 18585, 73494, 286834, 1108470, 4243128, 16111333, 60718488, 227302086, 845689753, 3128786415, 11515509603, 42179651417, 153808740042, 558532554942, 2020325112767, 7281212274165, 26151068072301, 93618849857345, 334119804933861

Offset: 0

Alois P. Heinz, Sep 09 2008

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 27.
N. J. A. Sloane, Transforms

3rd column of A144074. Row sums of A275414.

Cf. A256142.

m:=30; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&*[1/(1-x^k)^(3^k): k in [1..m]]) )); // G. C. Greubel, Nov 09 2018

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->3^j)(n): seq(a(n), n=0..40);

etr[p_] := Module[{b}, b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d*p[d], {d, Divisors[j]}]*b[n - j], {j, 1, n}]/n]; b]; a[n_] := etr[Function[3^#]][n]; Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Mar 09 2015, after Alois P. Heinz *)
CoefficientList[Series[Product[1/(1-x^k)^(3^k), {k, 1, 30}], {x, 0, 30}], x] (* G. C. Greubel, Nov 09 2018 *)

m=30; x='x+O('x^m); Vec(prod(k=1,m,1/(1-x^k)^(3^k))) \\ G. C. Greubel, Nov 09 2018

G.f.: Product_{j>0} 1/(1-x^j)^(3^j).
a(n) ~  3^n * exp(2*sqrt(n) - 1/2 + c) / (2 * sqrt(Pi) * n^(3/4)), where c = Sum_{m>=2} 1/(m*(3^(m-1)-1)) = 0.3047484092142751906436952201501007636114175... . - Vaclav Kotesovec, Mar 14 2015
G.f.: exp(3*Sum_{k>=1} x^k/(k*(1 - 3*x^k))). - Ilya Gutkovskiy, Nov 09 2018

A261052 Expansion of Product_{k>=1} (1+x^k)^(k!).

Original entry on oeis.org

1, 1, 2, 8, 31, 157, 915, 6213, 48240, 423398, 4147775, 44882107, 531564195, 6837784087, 94909482330, 1413561537884, 22482554909451, 380269771734265, 6815003300096013, 128992737080703803, 2571218642722865352, 53835084737513866662, 1181222084520177393143

Offset: 0

Vaclav Kotesovec, Aug 08 2015

nonn

Weigh transform of the factorial numbers. - Alois P. Heinz, Jun 11 2018

Alois P. Heinz, Table of n, a(n) for n = 0..450

Cf. A000142, A107895, A168246, A261053, A026007, A027998, A248882, A102866, A256142.

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      add(binomial(i!, j)*b(n-i*j,i-1), j=0..n/i)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..25);  # Alois P. Heinz, Aug 08 2015

nmax=25; CoefficientList[Series[Product[(1+x^k)^(k!),{k,1,nmax}],{x,0,nmax}],x]

seq(n)={Vec(exp(x*Ser(dirmul(vector(n, n, n!), -vector(n, n, (-1)^n/n)))))} \\ Andrew Howroyd, Jun 22 2018

a(n) ~ n! * (1 + 1/n + 2/n^2 + 10/n^3 + 57/n^4 + 401/n^5 + 3382/n^6 + 33183/n^7 + 371600/n^8 + 4685547/n^9 + 65792453/n^10).

cp's OEIS Frontend

A261049 Expansion of Product_{k>=1} (1+x^k)^(p(k)), where p(k) is the partition function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A102866 Number of finite languages over a binary alphabet (set of nonempty binary words of total length n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A144074 Number A(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A292804 Number A(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A261050 Expansion of Product_{k>=1} (1+x^k)^(Fibonacci(k)).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A261053 Expansion of Product_{k>=1} (1+x^k)^(k^k).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula