login
A019533
Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n vertices; sequence gives I_c(n,4).
2
6, 10, 16, 31, 40, 68, 93, 154, 215, 354, 531, 863, 1249
OFFSET
5,1
REFERENCES
Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).
CROSSREFS
Sequence in context: A020741 A274287 A090991 * A053301 A262542 A315351
KEYWORD
nonn,more
EXTENSIONS
Degree corrected and a(16)-a(17) from Sean A. Irvine, Apr 01 2019
STATUS
approved