416524

Appears in sequences

• Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) = number of interior vertices where exactly two lines cross.at n=44A334701
• Number of n-step walks from one of the vertices with degree 3 to itself on the four-vertex diamond graph.at n=15A344261