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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127683 Number of non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets of the n-cycle graph having 2n isomorphic representatives. 3
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 2, 5, 4, 8, 9, 15, 16, 27, 30, 46, 54, 80, 96, 139, 167, 237, 292, 403, 501, 687, 862, 1164, 1472, 1974, 2512, 3347, 4274, 5668, 7275, 9604, 12359, 16278, 21006, 27597, 35690, 46819, 60663, 79478, 103128 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,19

LINKS

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

R. Bisdorff and J.-L. Marichal, Counting non-isomorphic maximal independent sets of the n-cycle graph, arXiv:math/0701647 [math.CO], 2007-2008.

FORMULA

a(n) = (1/2)*(A113788(n) - Sum_(d|n} mu(n/d) A127682(d)).

CROSSREFS

Cf. A113788, A127682.

Sequence in context: A008818 A089599 A206556 * A127686 A293548 A034400

Adjacent sequences:  A127680 A127681 A127682 * A127684 A127685 A127686

KEYWORD

easy,nonn

AUTHOR

Jean-Luc Marichal (jean-luc.marichal(AT)uni.lu), Jan 24 2007

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 21 06:31 EST 2017. Contains 294989 sequences.