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