A019534 - OEIS

This site is supported by donations to The OEIS Foundation.

A019534

Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n nodes; sequence gives I_c(2n,6).

7, 18, 63, 133, 285 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`3,1`
	REFERENCES	`Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).`
	LINKS	`Table of n, a(n) for n=3..7.` `T. Sillke, For more info`
	CROSSREFS	`Sequence in context: A220031 A197092 A223240 * A024830 A030982 A203381` `Adjacent sequences: A019531 A019532 A019533 * A019535 A019536 A019537`
	KEYWORD	`nonn`
	AUTHOR	`Achim Flammenkamp (achim(AT)HRZ.Uni-Bielefeld.DE)`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified May 22 09:43 EDT 2013. Contains 225519 sequences.