465844

Appears in sequences

• Two-loop graph coloring a rectangular array: number of n X 2 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=7A223249
• T(n,k)=Two-loop graph coloring a rectangular array: number of nXk 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=37A223255
• T(n,k)=3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=37A223352
• Numbers n such that n^2+k-1 is the sum of two nonzero squares in exactly k ways for all k = 1, 2, 3.at n=32A273341