|
%I #13 Oct 25 2015 15:38:33
%S 1,1,1,1,2,1,1,5,4,1,1,8,18,6,1,1,15,67,63,9,1
%N Triangle read by rows: T(n,k) (n>=1,0<=k<n) is the number of graphs with n vertices and Grundy number k.
%C Row sums give A000088, n >= 1.
%C The Grundy number of a graph is the largest k such that the graph has a greedy k-coloring for some ordering of its vertices. - _Charles R Greathouse IV_, Oct 16 2015
%H FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000172">The Grundy number of a graph</a>.
%e Triangle begins:
%e 1,
%e 1,1,
%e 1,2,1,
%e 1,5,4,1,
%e 1,8,18,6,1,
%e 1,15,67,63,9,1,
%e ...
%Y Cf. A000088.
%K nonn,tabl,more
%O 1,5
%A _Christian Stump_, Oct 14 2015
|
