102124

Appears in sequences

• Structured meta-prism numbers, the n-th number from a structured n-gonal prism number sequence.at n=21A100177
• Fourth left hand column of triangle A163940.at n=11A163944
• Number of ways to place 2 nonattacking nightriders on an n X n cylindrical board.at n=21A196810
• 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=6A223249
• Two-loop graph coloring a rectangular array: number of nX7 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=1A223254
• 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=29A223255
• 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=34A223255
• 3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nX7 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=1A223351
• 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=29A223352
• 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=34A223352
• Numbers that are values of the totient function (A002202) but not of the reduced totient function (A002174).at n=34A270265