id:A019534 - OEIS Search Results

Search: id:A019534

Displaying 1-1 of 1 results found.

page 1

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).

+0
1

7, 18, 63, 133, 285 (list; graph; listen)

	OFFSET	`3,1`
	REFERENCES	`Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).`
	LINKS	`T. Sillke, For more info`
	CROSSREFS	`Sequence in context: A002764 A124053 A084819 this_sequence A024830 A030982 A156238` `Adjacent sequences: A019531 A019532 A019533 this_sequence A019535 A019536 A019537`
	KEYWORD	`nonn`
	AUTHOR	`Achim Flammenkamp (achim(AT)HRZ.Uni-Bielefeld.DE)`

page 1

Search completed in 0.002 seconds

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.