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”).
%I M2199 #25 Jan 04 2018 04:24:30
%S 0,0,0,0,0,0,0,0,1,0,3,0,6,0,10,0,15,1,21,4,28,10,36,20,45,35,56,56,
%T 71,84,93,120,126,165,175,221,246,292,346,385,483,511,666,686,906,932,
%U 1218,1278,1624,1761,2157,2427,2866,3333,3822,4551
%N Number of strict 7th-order maximal independent sets in path graph.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D R. Yanco and A. Bagchi, "K-th order maximal independent sets in path and cycle graphs", J. Graph Theory, submitted, 1994, apparently unpublished.
%H R. Yanco, <a href="/A007380/a007380.pdf">Letter and Email to N. J. A. Sloane, 1994</a>
%F Apparently, g.f. = -x^9/((x^9+x^2-1)*(x-1)^2*(1+x)^2) with recurrence a(n)= 3*a(n-2) - 3*a(n-4) + a(n-6) + a(n-9) - 2*a(n-11) + a(n-13). - _R. J. Mathar_, Oct 30 2009
%F a(n) = A007381(n) - b(n) where b(2*n+1) = 1 and b(2*n) = n+1. - _Sean A. Irvine_, Jan 02 2018
%Y Cf. A007381.
%K nonn
%O 1,11
%A _N. J. A. Sloane_, _Mira Bernstein_
%E More terms from _Sean A. Irvine_, Jan 02 2018