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”).

A263781
Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and exactly two more elements moved upwards than downwards
1
0, 0, 0, 0, 0, 1, 3, 11, 31, 93, 248, 670, 1724, 4434, 11120, 27772, 68402, 167695, 407659, 986955, 2376323, 5702352, 13631753, 32500113, 77272919, 183336571, 434092838, 1026096990, 2421667040, 5707720617, 13436324063, 31596325769
OFFSET
1,7
COMMENTS
Column 2 of A263787
LINKS
EXAMPLE
All solutions for n=7
..2....0....2
..0....3....0
..1....1....1
..5....2....3
..3....6....6
..4....4....4
..6....5....5
CROSSREFS
Sequence in context: A108898 A291887 A217323 * A119901 A106934 A146581
KEYWORD
nonn
AUTHOR
R. H. Hardin, Oct 26 2015
STATUS
approved