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”).
%I #4 Jan 20 2016 06:42:21
%S 1,5,58,1398,55896,3353880,281725200,31553227440,4543664711040,
%T 817859648350080
%N Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to at least one horizontal neighbor and the top left element equal to 0.
%C Column 5 of A267724.
%e Some solutions for n=4
%e ..0..0..3..3..3....0..0..1..1..1....0..0..1..1..1....0..0..0..3..3
%e ..0..0..0..2..2....3..3..3..2..2....2..2..2..2..2....0..0..1..1..1
%e ..1..1..1..1..1....3..3..2..2..2....3..3..0..0..0....2..2..3..3..3
%e ..2..2..2..3..3....1..1..0..0..0....3..3..3..1..1....1..1..2..2..2
%Y Cf. A267724.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 20 2016