A263341 Triangle read by rows: T(n,k) is the number of unlabeled simple graphs on n vertices with independence number k.
1, 1, 1, 1, 2, 1, 1, 6, 3, 1, 1, 13, 15, 4, 1, 1, 37, 82, 30, 5, 1, 1, 106, 578, 301, 51, 6, 1, 1, 409, 6021, 4985, 842, 80, 7, 1, 1, 1896, 101267, 142276, 27107, 1995, 117, 8, 1, 1, 12171, 2882460, 7269487, 1724440, 112225, 4210, 164, 9, 1, 1, 105070, 138787233, 655015612, 210799447, 13893557, 388547, 8165, 221, 10, 1
Offset: 1
Examples
Triangle begins: 1; 1, 1; 1, 2, 1; 1, 6, 3, 1; 1, 13, 15, 4, 1; 1, 37, 82, 30, 5, 1; 1, 106, 578, 301, 51, 6, 1; 1, 409, 6021, 4985, 842, 80, 7, 1; 1, 1896, 101267, 142276, 27107, 1995, 117, 8, 1; 1, 12171, 2882460, 7269487, 1724440, 112225, 4210, 164, 9, 1; ...
Links
- Brendan McKay, Table of n, a(n) for n = 1..91 (first 13 rows)
- FindStat - Combinatorial Statistic Finder, The length of the maximal independent set of vertices of a graph.
- FindStat - Combinatorial Statistic Finder, The order of the largest clique of the graph.
- Eric Weisstein's World of Mathematics, Clique Number
- Eric Weisstein's World of Mathematics, Independence Number
- Wikipedia, Clique (graph theory)
Crossrefs
Extensions
a(21)-a(28) from Geoffrey Critzer, Sep 22 2016
Rows 8-10 from Eric W. Weisstein, May 16 2017
Rows 11-13 from Brendan McKay, Feb 18 2020
Name clarified by Andrew Howroyd, Feb 18 2020
Comments