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 A007390 M3257 #22 Jun 14 2019 21:48:55 %S A007390 0,0,0,4,5,15,21,44,66,120,187,319,507,840,1348,2204,3553,5775,9329, %T A007390 15124,24454,39600,64055,103679,167735,271440,439176,710644,1149821, %U A007390 1860495,3010317,4870844,7881162,12752040,20633203,33385279,54018483 %N A007390 Number of strict (-1)st-order maximal independent sets in cycle graph. %D A007390 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A007390 R. Yanco and A. Bagchi, ``K-th order maximal independent sets in path and cycle graphs,'' J. Graph Theory, submitted, 1994. %H A007390 R. Yanco, <a href="/A007380/a007380.pdf">Letter and Email to N. J. A. Sloane, 1994</a> %F A007390 a(n) = A000204(n) - b(n) where b(1) = 1, b(2*n+1) = 2*n+2, b(2*n) = 3. - _Sean A. Irvine_, Jan 02 2018 %F A007390 Conjectures from _Colin Barker_, Jun 14 2019: (Start) %F A007390 G.f.: x^4*(4 + x - 2*x^2 - x^3) / ((1 - x)^2*(1 + x)^2*(1 - x - x^2)). %F A007390 a(n) = a(n-1) + 3*a(n-2) - 2*a(n-3) - 3*a(n-4) + a(n-5) + a(n-6) for n>7. %F A007390 (End) %K A007390 nonn %O A007390 1,4 %A A007390 _N. J. A. Sloane_, _Mira Bernstein_ %E A007390 a(18) corrected and more terms from _Sean A. Irvine_, Jan 02 2018