42144

Appears in sequences

• 3-loop graph coloring a rectangular array: number of n X 1 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=8A223240
• Numbers k such that Bernoulli number B_{k} has denominator 4501770.at n=2A295597
• a(0)=1; a(1)=1; for n >= 2, a(n) = a(n-A000120(n)) + a(n-1-A023416(n)).at n=41A297216
• a(0) = 0 by convention; for n>0, a(n) is the number of edges in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter).at n=8A331448
• Triangle read by rows: T(n,m) (n >= m >= 1) = number of line segments formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=35A331454
• Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3*n new points on the other three sides: sequence gives number of regions in the resulting planar graph.at n=9A367278
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph.at n=37A367324