login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A019535
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(n,6).
2
8, 13, 22, 33, 58, 127, 145, 262
OFFSET
7,1
REFERENCES
Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).
CROSSREFS
Sequence in context: A101642 A269354 A195984 * A229446 A205704 A337212
KEYWORD
nonn,more
EXTENSIONS
Degree corrected by Sean A. Irvine, Apr 01 2019
STATUS
approved