

A263324


Triangle read by rows: T(n,k) (n>=1,0<=k<n) is the number of graphs with n vertices and Grundy number k.


0



1, 1, 1, 1, 2, 1, 1, 5, 4, 1, 1, 8, 18, 6, 1, 1, 15, 67, 63, 9, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


COMMENTS

Row sums give A000088, n >= 1.
The Grundy number of a graph is the largest k such that the graph has a greedy kcoloring for some ordering of its vertices.  Charles R Greathouse IV, Oct 16 2015


LINKS

Table of n, a(n) for n=1..21.
FindStat  Combinatorial Statistic Finder, The Grundy number of a graph.


EXAMPLE

Triangle begins:
1,
1,1,
1,2,1,
1,5,4,1,
1,8,18,6,1,
1,15,67,63,9,1,
...


CROSSREFS

Cf. A000088.
Sequence in context: A316399 A139347 A288620 * A284949 A241500 A152924
Adjacent sequences: A263321 A263322 A263323 * A263325 A263326 A263327


KEYWORD

nonn,tabl,more


AUTHOR

Christian Stump, Oct 14 2015


STATUS

approved



