Skip to main content
5 events
when toggle format what by license comment
Nov 25 at 3:30 comment added Ira Gessel Is there a combinatorial proof that the number of fair permutations of $\{1,2,\dots,n\}$, with exponential generating function $e^x\sec x$, is divisible by $2^{\lfloor n/2\rfloor}$?
Nov 28, 2012 at 2:37 history edited Richard Stanley CC BY-SA 3.0
addendum added
Nov 21, 2012 at 5:25 vote accept Timothy Chow
Nov 21, 2012 at 2:05 history edited Richard Stanley CC BY-SA 3.0
typo corrected
Nov 21, 2012 at 1:29 history answered Richard Stanley CC BY-SA 3.0