cp's OEIS Frontend

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.

A007383 Number of strict first-order maximal independent sets in path graph.

This page as a plain text file.
%I A007383 M2228 #23 Jan 02 2018 17:09:11
%S A007383 0,0,1,0,3,1,6,4,11,10,20,21,36,41,64,77,113,141,199,254,350,453,615,
%T A007383 803,1080,1418,1896,2498,3328,4394,5841,7722,10251,13563,17990,23814,
%U A007383 31571,41804,55404,73375,97228,128779,170624,226007,299425
%N A007383 Number of strict first-order maximal independent sets in path graph.
%D A007383 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D A007383 R. Yanco and A. Bagchi, K-th order maximal independent sets in path and cycle graphs, J. Graph Theory, submitted, 1994.
%H A007383 R. Yanco, <a href="/A007380/a007380.pdf">Letter and Email to N. J. A. Sloane, 1994</a>
%F A007383 Empirical g.f.: -x^3 / ((x-1)^2*(x+1)^2*(x^3+x^2-1)). - _Colin Barker_, Mar 29 2014
%F A007383 a(n) = A000931(n + 6) - b(n) where b(2*n+1) = 1 and b(2*n) = n+1. - _Sean A. Irvine_, Jan 02 2018
%Y A007383 Cf. A000931.
%K A007383 nonn
%O A007383 1,5
%A A007383 _N. J. A. Sloane_, _Mira Bernstein_
%E A007383 More terms from _Sean A. Irvine_, Jan 02 2018