login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 k-coloring for some ordering of its vertices. - Charles R Greathouse IV, Oct 16 2015
LINKS
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 A263294 A241500
KEYWORD
nonn,tabl,more
AUTHOR
Christian Stump, Oct 14 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)