id:A084283 - OEIS Search Results

Search: id:A084283

Displaying 1-1 of 1 results found.

page 1

Number of connected labeled 3-colorable (i.e. chromatic number <= 3) graphs on n nodes.

+0
4

1, 1, 4, 37, 667, 21886 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`Eric Weisstein's World of Mathematics, n-Colorable Graph`
	CROSSREFS	`Cf. A001832, A084283, A084284, A084285, A084286.` `Sequence in context: A097998 A094408 A061683 this_sequence A133471 A027461 A073237` `Adjacent sequences: A084280 A084281 A084282 this_sequence A084284 A084285 A084286`
	KEYWORD	`nonn,more`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com), May 25, 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.