|
%I #4 Nov 12 2015 22:58:50
%S 0,12,96,529,4843,44264,352713,2840274,23795758,197390196,1619132059,
%T 13345740560,110326933611,910298134238,7505842151352,61932503872184,
%U 511075503235669,4216464623838747,34786555887673881,287016646384919794
%N Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,1 2,2 1,0 -1,2 -2,-1 or -1,-1.
%C Column 3 of A264422.
%H R. H. Hardin, <a href="/A264418/b264418.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A264418/a264418.txt">Empirical recurrence of order 70</a>
%F Empirical recurrence of order 70 (see link above)
%e Some solutions for n=4
%e ..9..6..1..5....5.10..1..2....5..6..7..2....9..6..7..5....9.10..4..2
%e .13.10..2..3....0..4.15..3...13..1.15..3....0..1..2..3....0..1..5..3
%e ..4.14..0..7...13.14..6..7....4.14..0.10...13.14.19.10...13.14..6..7
%e .17.18.19.11....8.18.19.11...17..9.19.11...17.18..4.11....8.18.19.11
%e .12.16..8.15...12.16.17..9...12.16..8.18...12.16..8.15...12.16.17.15
%Y Cf. A264422.
%K nonn
%O 1,2
%A _R. H. Hardin_, Nov 12 2015
| 