|
%I #25 Jun 10 2021 21:48:35
%S 1,1,2,6,13,44,144,577,2457,12499,72394,508942,4408389,49858593,
%T 769196039,16729819397
%N Number of simple connected graphs on n nodes with no cycle of length 5.
%C Inverse EULER transformation of A345216 (not necessarily connected)
%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 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 29e68fa.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CycleGraph.html">Cycle Graph</a>
%Y Cf. Squarefree (C_4) graphs A077269.
%K nonn,hard,more
%O 1,3
%A _Travis Hoppe_ and _Anna Petrone_, Apr 28 2014
%E a(11)-a(14) added using tinygraph by _Falk Hüffner_, Sep 22 2020
%E a(15) and a(16) added by _Brendan McKay_, Jun 10 2021
|
