|
%I #6 Nov 10 2015 10:23:34
%S 465,23841,3801496,406984645,51140612201,6038706224797,
%T 730020995021349,87444873531787712,10511065730167109021,
%U 1261752818972546950617,151539307218181858446417,18196609267644669936450969
%N Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having index change (+-,+-) 0,0 1,1 or 1,2.
%C Column 4 of A263964.
%H R. H. Hardin, <a href="/A263962/b263962.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A263962/a263962.txt">Empirical recurrence of order 82</a>
%F Empirical recurrence of order 82 (see link above)
%e Some solutions for n=2
%e ..0..5..2..9..4....0..1..9..3..8....0..1..8..7..4....0..5..6..3..4
%e .11..6..3..1.13....2.13..4.11.12...12..2..3.11..9...11.10..1..2..9
%e .10..8.12..7.14...10..7..5..6.14...10..5..6.13.14....7..8.12.13.14
%Y Cf. A263964.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 30 2015
| 