login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127684 Number of non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets of the n-cycle graph having n isomorphic representatives. 0

%I

%S 0,1,1,0,1,0,1,1,1,1,2,2,3,3,2,5,5,6,7,9,7,13,12,16,15,24,19,32,28,44,

%T 37,58,46,81,63,104,86,145,110,189,151,257,200,339,260,460,351,599,

%U 464,813,610,1069,816,1431,1078,1889,1424,2530,1897,3323,2513,4452,3319

%N Number of non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets of the n-cycle graph having n isomorphic representatives.

%H R. Bisdorff and J.-L. Marichal, <a href="http://arXiv.org/abs/math.CO/0701647">Counting non-isomorphic maximal independent sets of the n-cycle graph</a>, arXiv:0701647 (2007) and <a href="https://cs.uwaterloo.ca/journals/JIS/VOL11/Marichal/marichal.html">JIS 11 (2008) 08.5.7</a>.

%F a(n) = (Sum(d divides n) mu(n/d) A127682(d)) + (A127683(n/2)*[n even]).

%F a(n) = (Sum(d divides n) mu(n/d) A127682(d)) + (A127683(n/2)*[n even])

%Y Cf. A127682, A127683.

%K easy,nonn

%O 1,11

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 27 16:27 EDT 2022. Contains 354896 sequences. (Running on oeis4.)