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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019534 Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n nodes; sequence gives I_c(2n,6). 0
7, 18, 63, 133, 285 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

REFERENCES

Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).

LINKS

Table of n, a(n) for n=3..7.

T. Sillke, For more info

CROSSREFS

Sequence in context: A220031 A197092 A223240 * A024830 A030982 A203381

Adjacent sequences:  A019531 A019532 A019533 * A019535 A019536 A019537

KEYWORD

nonn

AUTHOR

Achim Flammenkamp (achim(AT)HRZ.Uni-Bielefeld.DE)

STATUS

approved

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

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

Last modified October 22 21:52 EDT 2014. Contains 248411 sequences.