cp's OEIS Frontend

A223551 Petersen graph (3,1) coloring a rectangular array: number of n X n 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 A223551 #8 Jun 02 2025 08:29:20
%S A223551 1,27,3249,1795473,4715559621,59043582882099,3541866135681593043,
%T A223551 1020092567883788131348995,1412857454503152706541498629089,
%U A223551 9420448274769727958157865214329990383
%N A223551 Petersen graph (3,1) coloring a rectangular array: number of n X n 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 A223551 Diagonal of A223556
%H A223551 R. H. Hardin, <a href="/A223551/b223551.txt">Table of n, a(n) for n = 1..12</a>
%e A223551 Some solutions for n=3
%e A223551 ..0..1..4....0..3..4....0..3..4....0..3..0....0..3..4....0..2..0....0..3..4
%e A223551 ..0..3..0....5..3..4....5..3..0....5..3..4....5..3..4....0..2..1....4..5..4
%e A223551 ..0..2..1....4..5..2....4..3..4....4..3..0....0..3..0....5..4..1....4..1..2
%K A223551 nonn
%O A223551 1,2
%A A223551 _R. H. Hardin_ Mar 22 2013