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!)
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

%I #10 Jul 22 2017 08:38:20

%S 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,

%T 96,139,167,237,292,403,501,687,862,1164,1472,1974,2512,3347,4274,

%U 5668,7275,9604,12359,16278,21006,27597,35690,46819,60663,79478,103128

%N 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.

%H R. Bisdorff and J.-L. Marichal, <a href="https://arxiv.org/abs/math/0701647">Counting non-isomorphic maximal independent sets of the n-cycle graph</a>, arXiv:math/0701647 [math.CO], 2007-2008.

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

%Y Cf. A113788, A127682.

%K easy,nonn

%O 1,19

%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 April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)