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

1, 4, 28, 268, 3148, 43564, 692428, 12390508, 245896588, 5351817004, 126614238028, 3232332423148, 88500275727628, 2585371577628844, 80227707005300428, 2634361286274638188, 91223969834203056268, 3321457538305952791084, 126817592900018186967628

Offset

0,2

Comments

Self-convolution of A306045.

Convolution of A316142 and A316143.

Conjecture: Let k be a positive integer. The sequence obtained by reducing a(n) modulo k is eventually periodic with the period dividing phi(k) = A000010(k). For example, modulo 7 we obtain the sequence [1, 4, 0, 2, 5, 3, 2, 4, 0, 2, 5, 3, 2, 4, 0, 2, 5, 3, 2, ...], with a preperiod of length 1 and an apparent period thereafter of 6 = phi(7). - Peter Bala, Mar 03 2023

Links

Vaclav Kotesovec, Table of n, a(n) for n = 0..400

Formula

Sum_{k=0..n} binomial(n,k) * A306045(k) * A306045(n-k).

a(n) ~ n! * exp(Pi * sqrt(n/log(2)) - Pi^2 * (1 - 1/log(2)) / 8) / (2^(7/2) * n^(5/4) * log(2)^(n - 1/4)).

Mathematica

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

Crossrefs

Cf. A001934, A306045, A316142, A316143.

Sequence in context: A360727 A353013 A284756 * A138272 A367470 A361049

Adjacent sequences: A316141 A316142 A316143 * A316145 A316146 A316147

Keyword

nonn,easy

Author

Vaclav Kotesovec, Jun 25 2018

Status

approved