A164575 a(n) = n! * [x^n] 2*(tan(x))^2*(sec(x) + tan(x)).

0, 0, 4, 12, 56, 240, 1324, 7392, 49136, 337920, 2652244, 21660672, 196658216, 1859020800, 19192151164, 206057828352, 2385488163296, 28669154426880, 367966308562084, 4893320282898432, 68978503204900376, 1005520890400604160, 15445185289163949004, 244890632417194278912

Offset

0,3

Links

Table of n, a(n) for n=0..23.

Masato Kobayashi, A new refinement of Euler numbers on counting alternating permutations, arXiv:1908.00701 [math.CO], 2019.

Formula

a(n-2) = |{up-down 2nd-max-upper permutations in S_n}| for n >= 2 (see Definition 3.4 in Kobayashi).

a(0) = 0 and a(n) = 2*A000142(n)*Sum_{i,j,k>=0, (2*i+1)+(2*j+1)+k=n} A000111(2*i+1)*A000111(2*j+1)*A000111(k)/(A000142(2*i+1)*A000142(2*j+1)*A000142(k)) for n > 0 (see Lemma 3.6 in Kobayashi).

a(2*n) = 2*A225689(2*n) (see Lemma 4.2 in Kobayashi).

a(n) ~ n! * 2^(n+4) * n^2 / Pi^(n+3). - Vaclav Kotesovec, Aug 12 2019

Maple

gf := (2*sin(x)*tan(x))/(1 - sin(x)): ser := series(gf, x, 25):
seq(n!*coeff(ser, x, n), n=0..23); # Peter Luschny, Aug 19 2019

Mathematica

CoefficientList[Series[2Tan[x]^2(Sec[x]+Tan[x]), {x, 0, 23}], x]*Table[n!, {n, 0, 23}]

Prog

(PARI) my(x='x+O('x^30)); concat([0, 0], Vec(serlaplace(2*(tan(x))^2*(1/cos(x) + tan(x))))) \\ Michel Marcus, Aug 13 2019

Crossrefs

Cf. A000111, A000142, A000182, A000364, A009764, A013525, A024283, A181937, A225688, A225689.

Sequence in context: A149422 A149423 A295496 * A124004 A243785 A019266

Adjacent sequences: A164572 A164573 A164574 * A164576 A164577 A164578

Keyword

nonn,easy

Author

Stefano Spezia, Aug 12 2019

Status

approved