The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 Jan 08 2019 18:48:52
%S 0,1,0,1,1,1,3,1,3,6,5,9,10,15,24,25,39,55,70,101,130,184,256,332,467,
%T 636,862,1186,1596,2201,3006,4066,5581,7600,10371,14161,19265,26351,
%U 35935,48961,66866,91169,124417,169726,231425,315892,430865,587699
%N Number of (1+1) X (n+1) arrays of permutations of 0..n*2+1 with each element having directed index change 1,0 0,-1 1,2 or -1,1.
%H R. H. Hardin, <a href="/A264584/b264584.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-3) + a(n-4) + 2*a(n-5) - a(n-9) - a(n-10).
%F Empirical g.f.: x^2*(1 - x)*(1 + x + 2*x^2 + 2*x^3 + 2*x^4 + 2*x^5 + x^6) / (1 - x^3 - x^4 - 2*x^5 + x^9 + x^10). - _Colin Barker_, Jan 08 2019
%e All solutions for n=4:
%e ..1..5..3..4..8
%e ..6..7..0..9..2
%Y Row 1 of A264583.
%K nonn
%O 1,7
%A _R. H. Hardin_, Nov 18 2015