|
|
A282901
|
|
Number of permutations of 1,2,...,2n+1 obtainable via labeled chip-firing.
|
|
0
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
It is conjectured that the permutations counted by a(n) have at most n inversions.
|
|
LINKS
|
S. Hopkins, T. McConville, and J. Propp, Sorting via chip-firing, Electronic Journal of Combinatorics, 24, (2017), #P3.13.
|
|
EXAMPLE
|
For n=1 the a(1)=3 permutations are 123, 132, and 213.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|