login
Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a C5 (the cycle on 5 vertices).
0

%I #18 Jan 14 2016 16:33:50

%S 1,1,2,6,20,105,726,7827,127611,3166349,115369643,5981665266

%N Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a C5 (the cycle on 5 vertices).

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>

%K more,nonn

%O 1,3

%A _Jim Nastos_, Jan 07 2003

%E Claim that this equals the same for P5 instead of C5 removed by _Falk Hüffner_, Nov 27 2015

%E More terms added using tinygraph version 231ba55 by _Falk Hüffner_, Jan 12 2016