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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019533 Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n vertices; sequence gives I_c(n,5). 0
6, 10, 16, 31, 40, 68, 93, 154, 215, 354, 531 (list; graph; refs; listen; history; text; internal format)
OFFSET

5,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=5..15.

T. Sillke, For more info

CROSSREFS

Sequence in context: A020741 A274287 A090991 * A053301 A262542 A315351

Adjacent sequences:  A019530 A019531 A019532 * A019534 A019535 A019536

KEYWORD

nonn

AUTHOR

Achim Flammenkamp

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 March 22 04:32 EDT 2019. Contains 321406 sequences. (Running on oeis4.)