cp's OEIS Frontend

A223561 Petersen graph (3,1) coloring a rectangular array: number of 6Xn 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.

%I A223561 #6 Jun 02 2025 08:30:10
%S A223561 7776,177147,22284891,2960456193,414863325945,59043582882099,
%T A223561 8468395670690901,1218666102798243879,175642608583999726713,
%U A223561 25331295128141837865681,3654268425473611746796515
%N A223561 Petersen graph (3,1) coloring a rectangular array: number of 6Xn 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.
%C A223561 Row 6 of A223556
%H A223561 R. H. Hardin, <a href="/A223561/b223561.txt">Table of n, a(n) for n = 1..210</a>
%e A223561 Some solutions for n=3
%e A223561 ..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0
%e A223561 ..0..3..0....0..1..0....0..3..0....0..3..0....0..3..0....0..3..0....0..1..0
%e A223561 ..0..1..0....0..2..1....0..3..5....0..3..4....0..1..2....0..1..4....0..1..0
%e A223561 ..0..1..0....0..2..0....0..3..0....0..3..4....2..0..2....2..1..0....2..1..0
%e A223561 ..0..1..4....0..3..4....0..3..0....4..3..5....2..5..3....0..2..0....0..2..0
%e A223561 ..2..5..3....0..3..0....5..2..1....5..4..1....3..4..3....0..3..0....0..2..5
%K A223561 nonn
%O A223561 1,1
%A A223561 _R. H. Hardin_ Mar 22 2013