login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A282901
Number of permutations of 1,2,...,2n+1 obtainable via labeled chip-firing.
0
1, 3, 12, 54, 232
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, arXiv: 1612.06816 [math.CO], 2017.
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
Sequence in context: A370821 A329056 A191577 * A123348 A151204 A151205
KEYWORD
nonn,more
AUTHOR
James Propp, Feb 24 2017
STATUS
approved