cp's OEIS Frontend

A223503 Petersen graph (3,1) coloring a rectangular array: number of nX7 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 A223503 #6 Jun 02 2025 08:28:39
%S A223503 729,110427,22598167,4867038759,1065016901935,234215122981463,
%T A223503 51596648899152901,11373354088592222347,2507537188605388269479,
%U A223503 552889843504513864372699,121910555703890549598868125
%N A223503 Petersen graph (3,1) coloring a rectangular array: number of nX7 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 A223503 Column 7 of A223504
%H A223503 R. H. Hardin, <a href="/A223503/b223503.txt">Table of n, a(n) for n = 1..210</a>
%e A223503 Some solutions for n=3
%e A223503 ..0..1..0..1..2..5..4....0..1..0..1..0..3..5....0..1..0..1..0..3..4
%e A223503 ..0..1..4..1..4..5..4....0..1..4..3..0..2..0....0..1..2..1..4..1..0
%e A223503 ..0..1..2..1..4..1..4....0..1..0..1..0..3..0....0..1..4..1..2..1..4
%K A223503 nonn
%O A223503 1,1
%A A223503 _R. H. Hardin_ Mar 21 2013