609309

Appears in sequences

• Number of symmetric n X n integer matrices with adjacent elements differing by no more than 1, counting matrices differing by a constant only once.at n=4A141441
• T(n,k) = Number of lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by k or less and triangles differing by a constant counted only once.at n=14A195278
• Number of lower triangles of a 5X5 integer array with each element differing from all of its vertical and horizontal neighbors by n or less and triangles differing by a constant counted only once.at n=0A195281
• Petersen graph (3,1) coloring a rectangular array: number of n X 5 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.at n=2A223553
• T(n,k)=Petersen graph (3,1) coloring a rectangular array: number of nXk 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.at n=23A223556
• Petersen graph (3,1) coloring a rectangular array: number of 3 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.at n=4A223558