The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A007394 Number of strict 7th-order maximal independent sets in cycle graph. (Formerly M4590) 0
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 0, 20, 0, 33, 0, 48, 0, 65, 9, 84, 29, 105, 62, 128, 110, 153, 175, 189, 259, 247, 364, 340, 492, 483, 645, 693, 834, 989, 1081, 1392, 1421, 1925, 1904, 2613, 2597, 3492, 3586, 4620, 4978, 6090 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,18 REFERENCES N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). R. Yanco and A. Bagchi, K-th order maximal independent sets in path and cycle graphs, J. Graph Theory, submitted, 1994. LINKS FORMULA Empirical g.f.: x^18*(7*x^2-9) / ((x-1)^2*(x+1)^2*(x^9+x^2-1)). - Colin Barker, Mar 29 2014 a(n) = A007389(n) - b(n) where b(1) = 0, b(2*n+1) = 2*n+1, b(2*n) = 2. - Sean A. Irvine, Jan 02 2018 CROSSREFS Cf. A007389. Sequence in context: A136679 A299154 A070929 * A067153 A057405 A167354 Adjacent sequences: A007391 A007392 A007393 * A007395 A007396 A007397 KEYWORD nonn AUTHOR EXTENSIONS More terms from Sean A. Irvine, Jan 02 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 05:20 EST 2022. Contains 358485 sequences. (Running on oeis4.)