66108

Appears in sequences

• 24 'Reverse and Add' steps are needed to reach a palindrome.at n=34A065318
• Antidiagonal sums of A179748.at n=28A186425
• Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n).at n=34A228890
• Irregular triangular array read by rows: T(n,k) is the number of 2-colored simple labeled graphs on n nodes that have exactly k edges, 0<=k<=A002620(n), n>=1.at n=33A241669
• Number of (n+2) X (4+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=14A253506
• Number of cyclic binary sequences of length n containing no abelian 4th powers.at n=44A305594