login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245883 Number of distinct chromatic polynomials among all connected graphs on n nodes. 1
1, 1, 2, 5, 14, 50, 231, 1650, 21121, 584432 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.

Eric Weisstein's World of Mathematics, Chromatic Polynomial

CROSSREFS

Cf. A229048 (simple graphs, including disconnected ones, with unique chromatic polynomials).

Sequence in context: A006390 A100597 A022562 * A115340 A298361 A000109

Adjacent sequences:  A245880 A245881 A245882 * A245884 A245885 A245886

KEYWORD

nonn,hard,more

AUTHOR

Travis Hoppe and Anna Petrone, Aug 05 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 19:24 EDT 2018. Contains 316237 sequences. (Running on oeis4.)