|
%I M5007 #27 Feb 17 2021 07:35:04
%S 0,16,122,800,5296,36976,275792,2204480,18870016,172585936,1681843712,
%T 17411416160,190939611136,2211961358896,26999750469632,
%U 346419349043840,4661658528710656,65657186909139856,966054350401175552,14822897275566895520
%N Number of down-up permutations of n+6 starting with n+1.
%C Entringer numbers.
%D R. C. Entringer, A combinatorial interpretation of the Euler and Bernoulli numbers, Nieuw Archief voor Wiskunde, 14 (1966), 241-246.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H B. Bauslaugh and F. Ruskey, <a href="http://dx.doi.org/10.1007/BF01932127">Generating alternating permutations lexicographically</a>, Nordisk Tidskr. Informationsbehandling (BIT) 30 16-26 1990.
%H J. Millar, N. J. A. Sloane and N. E. Young, A new operation on sequences: the Boustrophedon transform, J. Combin. Theory, 17A (1996) 44-54 (<a href="http://neilsloane.com/doc/bous.txt">Abstract</a>, <a href="http://neilsloane.com/doc/bous.pdf">pdf</a>, <a href="http://neilsloane.com/doc/bous.ps">ps</a>).
%H C. Poupard, <a href="http://dx.doi.org/10.1016/0012-365X(82)90293-X">De nouvelles significations énumeratives des nombres d'Entringer</a>, Discrete Math., 38 (1982), 265-271.
%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>
%F From _Emeric Deutsch_, May 15 2004: (Start)
%F a(n) = Sum_{i=0..floor((n-1)/2)} (-1)^i * binomial(n, 2*i+1) * E[n + 4 - 2*i], where E[j] = A000111(j) = j! * [x^j] (sec(x) + tan(x)) are the up/down or Euler numbers.
%F a(n) = T(n+5, n), where T is the triangle in A008282. (End)
%e a(1)=16 because we have 2143657, 2143756, 2153647, 2153746, 2154637, 2154736, 2163547, 2163745, 2164537, 2164735, 2165734, 2173546, 2173645, 2174536, 2174635 and 2175634.
%p f:=sec(x)+tan(x): fser:=series(f,x=0,30): E[0]:=1: for n from 1 to 25 do E[n]:=n!*coeff(fser,x^n) od: a:=n->sum((-1)^i*binomial(n,2*i+1)*E[n+4-2*i],i=0..floor((n-1)/2)): seq(a(n),n=0..15);
%p # Alternatively after _Alois P. Heinz_ in A000111:
%p b := proc(u, o) option remember;
%p `if`(u + o = 0, 1, add(b(o - 1 + j, u - j), j = 1..u)) end:
%p a := n -> b(n, 5): seq(a(n), n = 0..21); # _Peter Luschny_, Oct 27 2017
%t t[n_, 0] := If[n == 0, 1, 0]; t[n_ , k_ ] := t[n, k] = t[n, k - 1] + t[n - 1, n - k]; a[n_] := t[n + 5, n]; Array[a, 30, 0] (* _Jean-François Alcover_, Feb 12 2016 *)
%Y Cf. A000111, A008282.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_.
%E More terms from _Jean-François Alcover_, Feb 12 2016
|
