cp's OEIS Frontend

A223510 Petersen graph (3,1) coloring a rectangular array: number of 7Xn 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, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.

%I A223510 #6 Jun 02 2025 08:29:13
%S A223510 46656,199497,46737819,7624417031,1463848507173,272386213374733,
%T A223510 51596648899152901,9751020046348716929,1847009269923130289513,
%U A223510 349837085675513092679371,66283942985024283877005239
%N A223510 Petersen graph (3,1) coloring a rectangular array: number of 7Xn 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, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.
%C A223510 Row 7 of A223504
%H A223510 R. H. Hardin, <a href="/A223510/b223510.txt">Table of n, a(n) for n = 1..210</a>
%e A223510 Some solutions for n=3
%e A223510 ..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0
%e A223510 ..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0
%e A223510 ..0..1..0....0..2..0....0..1..2....0..1..0....0..1..4....0..1..4....0..1..4
%e A223510 ..0..2..0....1..2..5....0..1..4....4..3..4....2..1..4....0..3..0....4..1..4
%e A223510 ..5..2..5....0..2..5....4..3..4....4..1..0....0..1..0....5..2..5....2..1..4
%e A223510 ..1..2..0....0..2..5....5..3..0....0..1..0....2..1..2....5..2..0....4..5..2
%e A223510 ..1..2..1....5..3..5....5..3..5....4..3..0....2..1..0....5..2..1....4..5..4
%K A223510 nonn
%O A223510 1,1
%A A223510 _R. H. Hardin_ Mar 21 2013