340080

Appears in sequences

• Number of 4-indecomposable (connected) graphs on n nodes.at n=32A128526
• a(n) = 2*F(n-1) + 2*F(n-3) + 10*F(n-5) + 9*F(n-8) where n >= 8 and F = A000045.at n=18A280932