The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249583 Number of permutations p of [n] such that p(i) > p(i+1) iff i == 2 (mod 3). 4

%I #23 Sep 03 2021 01:51:22

%S 1,1,1,2,5,9,40,169,477,3194,19241,74601,666160,5216485,25740261,

%T 287316122,2769073949,16591655817,222237912664,2543467934449,

%U 17929265150637,280180369563194,3712914075133121,30098784753112329,537546603651987424,8094884285992309261

%N Number of permutations p of [n] such that p(i) > p(i+1) iff i == 2 (mod 3).

%C This is the (UDU)* version of 3-alternating permutations of [n], (U=Up, D=Down).

%H Alois P. Heinz, <a href="/A249583/b249583.txt">Table of n, a(n) for n = 0..500</a>

%H J. M. Luck, <a href="https://arxiv.org/abs/1309.7764">On the frequencies of patterns of rises and falls</a>, arXiv:1309.7764, 2013

%H Anthony Mendes and Jeffrey Remmel, Generating functions from symmetric functions, Preliminary version of book, available from <a href="http://math.ucsd.edu/~remmel/">Jeffrey Remmel's home page</a>

%H R. P. Stanley, <a href="https://arxiv.org/abs/0912.4240">A survey of alternating permutations</a>, arXiv:0912.4240, 2009

%e a(2) = 1: 12.

%e a(3) = 2: 132, 231.

%e a(4) = 5: 1324, 1423, 2314, 2413, 3412.

%e a(5) = 9: 13245, 14235, 15234, 23145, 24135, 25134, 34125, 35124, 45123.

%e a(6) = 40: 132465, 132564, 142365, 142563, 143562, 152364, 152463, 153462, 162354, 162453, 163452, 231465, 231564, 241365, 241563, 243561, 251364, 251463, 253461, 261354, 261453, 263451, 341265, 341562, 342561, 351264, 351462, 352461, 361254, 361452, 362451, 451263, 451362, 452361, 461253, 461352, 462351, 561243, 561342, 562341.

%e a(7) = 169: 1324657, 1324756, 1325647, ..., 6723514, 6724513, 6734512.

%p b:= proc(u, o, t) option remember; `if`(u+o=0, 1,

%p `if`(t=2, add(b(u-j, o+j-1, irem(t+1, 3)), j=1..u),

%p add(b(u+j-1, o-j, irem(t+1, 3)), j=1..o)))

%p end:

%p a:= n-> b(0, n, 0):

%p seq(a(n), n=0..35);

%t b[u_, o_, t_] := b[u, o, t] = If[u + o == 0, 1, If[t == 2, Sum[b[u - j, o + j - 1, Mod[t+1, 3]], {j, 1, u}], Sum[b[u + j - 1, o - j, Mod[t+1, 3]], {j, 1, o}]]];

%t a[n_] := b[0, n, 0];

%t Table[a[n], {n, 0, 35}] (* _Jean-François Alcover_, Nov 06 2017, after _Alois P. Heinz_ *)

%Y Cf. A178963 (i=0), A249402 (i=1).

%K nonn

%O 0,4

%A _Alois P. Heinz_, Nov 01 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 07:55 EDT 2024. Contains 372538 sequences. (Running on oeis4.)