|
%I #23 Sep 23 2020 02:48:35
%S 0,0,0,0,8,68,709,10540,258623,11704072,1006628171,164059321534,
%T 50335903460830,29003487412989468
%N Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a C_5, where C_5 is the cycle graph on five vertices.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CycleGraph.html">Cycle Graph</a>
%F a(n) = A001349(n) - A241784(n).
%Y Cf. A001349, A241784.
%K nonn,more
%O 1,5
%A _Travis Hoppe_ and _Anna Petrone_, Jun 01 2014
%E a(11)-a(14) from formula by _Falk Hüffner_, Sep 22 2020
|
