A006785 Number of triangle-free graphs on n vertices. (Formerly M0841)

1, 2, 3, 7, 14, 38, 107, 410, 1897, 12172, 105071, 1262180, 20797002, 467871369, 14232552452, 581460254001, 31720840164950

Offset

1,2

References

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Table of n, a(n) for n=1..17.

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

CombOS - Combinatorial Object Server, Generate graphs

Jérôme Kunegis, Jun Sun, and Eiko Yoneki, Guided Graph Generation: Evaluation of Graph Generators in Terms of Network Statistics, and a New Algorithm, arXiv:2303.00635 [cs.SI], 2023, p. 17.

Brendan McKay, Emails to N. J. A. Sloane, 1991

B. D. McKay, Isomorph-free exhaustive generation, J Algorithms, 26 (1998) 306-324.

W. Pu, J. Choi, and E. Amir, Lifted Inference On Transitive Relations, Workshops at the Twenty-Seventh AAAI Conference on Statistical Relational Artificial Intelligence, 2013.

Eric Weisstein's World of Mathematics, Triangle-Free Graph

Crossrefs

Cf. A024607, A213434.

Row sums of A283417.

Sequence in context: A089790 A296417 A296418 * A274538 A113182 A165433

Adjacent sequences: A006782 A006783 A006784 * A006786 A006787 A006788

Keyword

nonn,more,changed

Author

N. J. A. Sloane

Extensions

2 more terms (from the McKay paper) from Vladeta Jovovic, May 17 2008

2 more terms from Brendan McKay, Jan 12 2013

Status

approved