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

Number of (5+1) X (n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.
1

%I #8 May 24 2024 13:18:42

%S 64,3025,240100,12723489,836655625,49887902736,3094960562500,

%T 189070860092416,11616066459512449,712189376049875689,

%U 43696683150462862276,2680340140662074289169,164425719052069496305216

%N Number of (5+1) X (n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.

%C Row 5 of A264090.

%H R. H. Hardin, <a href="/A264094/b264094.txt">Table of n, a(n) for n = 1..210</a>

%H R. H. Hardin, <a href="/A264094/a264094.txt">Empirical recurrence of order 96</a>

%F Empirical recurrence of order 96 (see link above).

%e Some solutions for n=2

%e ..0..1..6....0..2..1....0..2..1....0..1..6....0..1..6....0..1..2....0..1..2

%e ..4..3..9....4..3..9....3..4..5....4..3..9....3..4..9....3..4..5....3..4..9

%e ..2..7..8....6..8..7....6..8..7....2..7..8....2..8..7....7..6..8....6..8..7

%e ..5.11.10....5.10.11....9.10.11....5.10.11....5.11.10....9.11.10....5.10.15

%e .13.12.14...13.12.14...12.13.14...12.13.14...12.14.13...12.13.14...12.13.14

%e .16.15.17...16.15.17...15.17.16...15.17.16...16.15.17...15.16.17...11.17.16

%Y Cf. A264090.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 03 2015