login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007380 Number of 5th order maximal independent sets in path graph.
(Formerly M0132)
0
1, 2, 1, 3, 1, 4, 2, 5, 4, 6, 7, 7, 11, 9, 16, 13, 22, 20, 29, 31, 38, 47, 51, 69, 71, 98, 102, 136, 149, 187, 218, 258, 316, 360, 452, 509, 639, 727, 897, 1043 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

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.

FORMULA

Apparently a(n)= +a(n-2) +a(n-7) with g.f. -x*(1+2*x+x^3+x^5+x^6)/(-1+x^2+x^7). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 30 2009]

CROSSREFS

Sequence in context: A029194 A059499 A113322 * A029171 A079786 A032451

Adjacent sequences:  A007377 A007378 A007379 * A007381 A007382 A007383

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.