login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007383 Number of strict first-order maximal independent sets in path graph.
(Formerly M2228)
0
0, 0, 1, 0, 3, 1, 6, 4, 11, 10, 20, 21, 36, 41, 64, 77, 113, 141, 199, 254, 350, 453, 615, 803, 1080, 1418, 1896, 2498, 3328, 4394, 5841, 7722, 10251, 13563, 17990, 23814, 31571, 41804, 55404, 73375, 97228, 128779, 170624, 226007, 299425 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Yanco and A. Bagchi, K-th order maximal independent sets in path and cycle graphs, J. Graph Theory, submitted, 1994.

LINKS

Table of n, a(n) for n=1..45.

R. Yanco, Letter and Email to N. J. A. Sloane, 1994

FORMULA

Empirical g.f.: -x^3 / ((x-1)^2*(x+1)^2*(x^3+x^2-1)). - Colin Barker, Mar 29 2014

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

CROSSREFS

Cf. A000931.

Sequence in context: A127754 A328508 A210841 * A206434 A340179 A120394

Adjacent sequences:  A007380 A007381 A007382 * A007384 A007385 A007386

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Mira Bernstein

EXTENSIONS

More terms from Sean A. Irvine, Jan 02 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 00:17 EDT 2021. Contains 345080 sequences. (Running on oeis4.)