login
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,5).
2
7, 18, 63, 133, 285
OFFSET
3,1
REFERENCES
Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).
CROSSREFS
Sequence in context: A288743 A223240 A304142 * A024830 A262489 A030982
KEYWORD
nonn,more
EXTENSIONS
Degree corrected by Sean A. Irvine, Apr 01 2019
STATUS
approved