This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A007386 M2199 #25 Jan 04 2018 04:24:30 %S A007386 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 A007386 71,84,93,120,126,165,175,221,246,292,346,385,483,511,666,686,906,932, %U A007386 1218,1278,1624,1761,2157,2427,2866,3333,3822,4551 %N A007386 Number of strict 7th-order maximal independent sets in path graph. %D A007386 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A007386 R. Yanco and A. Bagchi, "K-th order maximal independent sets in path and cycle graphs", J. Graph Theory, submitted, 1994, apparently unpublished. %H A007386 R. Yanco, <a href="/A007380/a007380.pdf">Letter and Email to N. J. A. Sloane, 1994</a> %F A007386 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 A007386 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 A007386 Cf. A007381. %K A007386 nonn %O A007386 1,11 %A A007386 _N. J. A. Sloane_, _Mira Bernstein_ %E A007386 More terms from _Sean A. Irvine_, Jan 02 2018