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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007385 Number of strict 5th-order maximal independent sets in path graph.
(Formerly M2200)
0
0, 0, 0, 0, 0, 0, 1, 0, 3, 0, 6, 0, 10, 1, 15, 4, 21, 10, 28, 20, 37, 35, 50, 56, 70, 84, 101, 121, 148, 171, 217, 241, 315, 342, 451, 490, 638, 707, 896, 1022, 1256, 1473, 1765, 2111, 2492, 3007, 3535, 4263, 5030, 6028, 7164, 8520, 10195 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,9

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, apparently unpublished.

LINKS

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

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

FORMULA

Apparently a(n)= 3*a(n-2) -3*a(n-4) +a(n-6) +a(n-7) -2*a(n-9) +a(n-11) with g.f. -x^7/((x^7+x^2-1)*(x-1)^2*(1+x)^2). [From R. J. Mathar, Oct 30 2009]

a(n) = A007380(n) - b(n) where b(2*n+1) = 1 and b(2*n) = n+1.- Sean A. Irvine, Jan 02 2018

CROSSREFS

Cf. A007380.

Sequence in context: A290705 A115456 A007386 * A081978 A117784 A257896

Adjacent sequences:  A007382 A007383 A007384 * A007386 A007387 A007388

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 December 11 03:29 EST 2018. Contains 318049 sequences. (Running on oeis4.)