login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,19
LINKS
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
Sequence in context: A008818 A089599 A206556 * A127686 A293548 A318844
KEYWORD
easy,nonn
AUTHOR
Jean-Luc Marichal (jean-luc.marichal(AT)uni.lu), Jan 24 2007
STATUS
approved