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

A264252
Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.
1
29, 157, 1920, 14893, 147797, 1273553, 11868873, 105792288, 966768105, 8711282401, 79116828661, 715364020157, 6484379106368, 58694951850221, 531710495858013, 4814568992437201, 43606141278712001, 394890939651946112
OFFSET
1,1
COMMENTS
Column 3 of A264257.
LINKS
FORMULA
Empirical: a(n) = 19*a(n-1) -84*a(n-2) -440*a(n-3) +4562*a(n-4) -6128*a(n-5) -52306*a(n-6) +176044*a(n-7) +178409*a(n-8) -1566967*a(n-9) +1071970*a(n-10) +6050538*a(n-11) -10528356*a(n-12) -8015378*a(n-13) +32496674*a(n-14) -11033682*a(n-15) -40764983*a(n-16) +40764983*a(n-17) +11033682*a(n-18) -32496674*a(n-19) +8015378*a(n-20) +10528356*a(n-21) -6050538*a(n-22) -1071970*a(n-23) +1566967*a(n-24) -178409*a(n-25) -176044*a(n-26) +52306*a(n-27) +6128*a(n-28) -4562*a(n-29) +440*a(n-30) +84*a(n-31) -19*a(n-32) +a(n-33)
EXAMPLE
Some solutions for n=4
..1..5..3..2....1..5..3..2....1..5..3..2....1..5..6..2....1..2..6..7
..0..6..4.11....0..4.10.11....0..4..7..6....0..9.10..3....0..9..5..3
..9.10..8..7....9..8..6..7....9.10..8.15....4..8.11..7....4..8.11.10
.16.12.13.19...16.12.13.14...13.14.12.11...13.17.18.14...13.12.18.14
.17.18.14.15...17.18.19.15...17.16.19.18...12.16.19.15...17.16.19.15
CROSSREFS
Cf. A264257.
Sequence in context: A101096 A142827 A142938 * A264530 A141910 A111032
KEYWORD
nonn
AUTHOR
R. H. Hardin, Nov 09 2015
STATUS
approved