73088

Appears in sequences

• a(n) = n*a(n-1)+4*a(n-2)-4*(n-2)*a(n-3).at n=8A080252
• a(n) = 2*a(n-1) + 2*a(n-2), a(0)=0, a(1)=4.at n=11A116556
• Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1).at n=41A143022
• 4 X 4 X 4 triangular graph without horizontal edges coloring a rectangular array: number of n X 1 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=9A223408