42654

Appears in sequences

• 53 'Reverse and Add' steps are needed to reach a palindrome.at n=26A065320
• Number of irredundant sets in the n-ladder graph.at n=9A290513
• Number of directed graphs of n vertices with more than 1 component and outdegree 1.at n=7A329427
• 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=24A334701