1,6
A cubic graph is claw-free (contains no induced K_{1,3}) if and only if every vertex lies in a triangle. All graphs counted are simple (no loops or multiple edges).
Gordon Royle, Combinatorial Data.
K_4 is claw-free and so a(2) = 1, while the triangular prism is the only claw-free cubic graph on 6 vertices, so a(3) = 1.
Cf. A084657, A084658, A057848.
Sequence in context: A072337 A132751 A032020 * A073749 A201866 A191632
Adjacent sequences: A084653 A084654 A084655 * A084657 A084658 A084659
nonn
Gordon Royle (gordon(AT)maths.uwa.edu.au), Jun 02 2003
