login
A024607
Number of connected triangle-free graphs on n unlabeled nodes.
17
1, 1, 1, 3, 6, 19, 59, 267, 1380, 9832, 90842, 1144061, 19425052, 445781050, 13743625184, 566756900370, 31125101479652
OFFSET
1,4
LINKS
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
CombOS - Combinatorial Object Server, Generate graphs
Satvik Singh, Can entanglement hide behind triangle-free graphs?, arXiv:2010.11891 [quant-ph], 2020.
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Triangle-Free Graph
CROSSREFS
Inverse Euler transform of A006785.
Table of graphs on n nodes with clique number k is A126744.
Column k=1 of A283417.
Sequence in context: A332344 A345244 A052393 * A186022 A058818 A184937
KEYWORD
hard,more,nonn,nice
EXTENSIONS
2 more terms from Vladeta Jovovic, May 17 2008
2 more terms from A006785 by Martin Fuller, May 01 2015
STATUS
approved