|
%I #13 Apr 02 2019 03:10:18
%S 6,10,16,31,40,68,93,154,215,354,531,863,1249
%N 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).
%D Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).
%H T. Sillke, <a href="http://www.mathematik.uni-bielefeld.de/~sillke/">For more info</a>
%Y Cf. A019534, A019535.
%K nonn,more
%O 5,1
%A _Achim Flammenkamp_
%E Degree corrected and a(16)-a(17) from _Sean A. Irvine_, Apr 01 2019
|
