Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A199660

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of parity alternating permutations of [n] avoiding descents from odd to even numbers.
(history; published version)
#20 by Alois P. Heinz at Sat Oct 30 13:45:24 EDT 2021
STATUS

reviewed

approved

#19 by Michael De Vlieger at Sat Oct 30 13:16:03 EDT 2021
STATUS

proposed

reviewed

#18 by Jean-François Alcover at Sat Oct 30 11:38:12 EDT 2021
STATUS

editing

proposed

#17 by Jean-François Alcover at Sat Oct 30 11:38:05 EDT 2021
MATHEMATICA

a[n_] := If[n == 0, 1, With[{r = Quotient[n, 2]},

If[Mod[n, 2] == 0, (2^r+r-1)(r-1)!, r!]]];

Table[a[n], {n, 0, 35}] (* Jean-François Alcover, Oct 30 2021, after Alois P. Heinz *)

STATUS

approved

editing

#16 by Alois P. Heinz at Mon Apr 24 10:55:37 EDT 2017
STATUS

editing

approved

#15 by Alois P. Heinz at Mon Apr 24 10:39:31 EDT 2017
CROSSREFS

Cf. A285672.

STATUS

approved

editing

#14 by Alois P. Heinz at Mon Nov 25 14:21:57 EST 2013
STATUS

editing

approved

#13 by Alois P. Heinz at Wed Nov 20 11:38:48 EST 2013
CROSSREFS

Column k=0 of A232187.

STATUS

approved

editing

#12 by Alois P. Heinz at Wed Nov 20 11:20:33 EST 2013
STATUS

editing

approved

#11 by Alois P. Heinz at Wed Nov 20 11:20:05 EST 2013
NAME

Number of parity alternating permutations of [n] where an avoiding descents from odd to even element can only have a smaller left neighbor (if any)numbers.

STATUS

approved

editing