OFFSET
0,3
COMMENTS
Conjecture: Let p be prime. The sequence obtained by reducing a(n) modulo p for n >= 1 is purely periodic. If p = 4*m + 1 the period appears to be p - 1, while if p = 4*m + 3 the period appears to be 2*(p - 1). Cf. A245322. - Peter Bala, Jun 01 2022
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..224
FORMULA
a(n) ~ c * d^n * (n!)^2 / sqrt(n), where d = 2.82830192319144609189890882712268369027077465204866199572119508594067235975..., c = 0.3460492649810724519960613805096579760009441161242336020188358769124140... - Vaclav Kotesovec, Nov 05 2014, updated Jun 02 2022
EXAMPLE
E.g.f.: A(x) = 1 + x + 8*x^2/2! + 164*x^3/3! + 6400*x^4/4! + 404176*x^5/5! +...
where
A(x) = 1 + tan(x) + tan(2*x)^2 + tan(3*x)^3 + tan(4*x)^4 + tan(5*x)^5 +...
MATHEMATICA
nmax = 20; CoefficientList[Series[1 + Sum[Tan[k*x]^k, {k, 1, nmax}], {x, 0, nmax}], x] * Range[0, nmax]! (* Vaclav Kotesovec, May 31 2022 *)
Join[{1}, Table[Sum[(-1)^((n-k)/2) * 2^n * k^n * Sum[(-1)^j * Binomial[k, j] * Sum[(-1)^m * Binomial[j + m - 1, m] * StirlingS2[n, m] * m! / 2^m, {m, 1, n}], {j, 0, k}], {k, 0, n}], {n, 1, 20}]] (* Vaclav Kotesovec, Jun 01 2022 *)
PROG
(PARI) {a(n)=local(X=x+x*O(x^n), Egf); Egf=sum(m=0, n, tan(m*X)^m); n!*polcoeff(Egf, n)}
for(n=0, 20, print1(a(n), ", ") )
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Dec 31 2012
STATUS
approved