|
Search: id:A007392
|
|
|
| A007392 |
|
Number of strict 3rd-order maximal independent sets in cycle graph.
(Formerly M3727)
|
|
+0
1
|
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 12, 0, 21, 5, 32, 17, 45, 38, 65, 70, 99, 115, 156, 180, 247, 279, 385, 435, 590, 682, 896, 1067, 1360, 1657, 2073, 2553, 3173, 3913, 4865, 5986, 7455
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
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
|
Conjecture: a(n)= 3*a(n-2) -3*a(n-4) +a(n-5) +a(n-6) -2*a(n-7) +a(n-9) with g.f. x^10*(-5+3*x^2)/((x^5+x^2-1)*(x-1)^2*(1+x)^2). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 30 2009]
|
|
CROSSREFS
|
Sequence in context: A022898 A156550 A088307 this_sequence A052401 A024418 A167297
Adjacent sequences: A007389 A007390 A007391 this_sequence A007393 A007394 A007395
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein
|
|
|
Search completed in 0.002 seconds
|
