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 A007384 M2201 #17 Jan 02 2018 17:08:42 %S A007384 0,0,0,0,1,0,3,0,6,1,10,4,15,10,22,20,33,35,51,57,80,90,125,141,193, %T A007384 221,295,346,449,539,684,834,1045,1283,1600,1967,2451,3012,3752,4612, %U A007384 5738,7063,8770,10815,13403,16553,20488,25323,31326,38726 %N A007384 Number of strict 3rd-order maximal independent sets in path graph. %D A007384 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A007384 R. Yanco and A. Bagchi, ``K-th order maximal independent sets in path and cycle graphs,'' J. Graph Theory, submitted, 1994. %H A007384 R. Yanco, <a href="/A007380/a007380.pdf">Letter and Email to N. J. A. Sloane, 1994</a> %F A007384 Conjecture: a(n)= 3*a(n-2) -3*a(n-4) +a(n-5) +a(n-6) -2*a(n-7) +a(n-9) with g.f. -x^5/((x^5+x^2-1)*(x-1)^2*(1+x)^2). [From _R. J. Mathar_, Oct 30 2009] %F A007384 a(n) = A001687(n + 6) - b(n) where b(2*n+1) = 1 and b(2*n) = n+1. - _Sean A. Irvine_, Jan 02 2018 %Y A007384 Cf. A001687. %K A007384 nonn %O A007384 1,7 %A A007384 _N. J. A. Sloane_, _Mira Bernstein_ %E A007384 More terms from _Sean A. Irvine_, Jan 02 2018