Timeline for Permutations which avoid consecutive entries of the form (m,m+1)
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 15, 2018 at 16:33 | vote | accept | sayantan dasgupta | ||
| Jan 15, 2018 at 3:50 | answer | added | Gjergji Zaimi | timeline score: 1 | |
| Jan 15, 2018 at 3:42 | comment | added | YCor | You might be motivated by interval exchanges? Anyway, this is oeis.org/A000255 up to shift by 1. An induction formula for A000255 is $a(n)=na(n-1)+(n-1) a(n-2)$, $a(0)=a(1) =1$. Calculating a few terms and looking in Sloane's OEIS is often efficient for such questions. | |
| Jan 15, 2018 at 3:34 | history | edited | Gjergji Zaimi | CC BY-SA 3.0 |
edited tags; edited title
|
| Jan 15, 2018 at 3:18 | review | First posts | |||
| Jan 15, 2018 at 3:54 | |||||
| Jan 15, 2018 at 3:16 | history | asked | sayantan dasgupta | CC BY-SA 3.0 |