Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127686
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127686 Number of non-isomorphic maximal independent sets of the n-cycle graph having no symmetry axis. +0
1
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, 55, 80, 96, 139, 168, 237, 293, 403, 503, 687, 864, 1164, 1477, 1974, 2516, 3348, 4282, 5668, 7284, 9604, 12374, 16279, 21022, 27597, 35718, 46819, 60693, 79480, 103174 (list; graph; listen)
OFFSET

1,19

COMMENT

Number of non-isomorphic (i.e. defined up to a rotation and a reflection) maximal independent sets of the n-cycle graph having no symmetry axis. Also: Number of cyclic and non-palindromic compositions of n in which each term is either 2 or 3, where a clockwise writing is not distinguished from its counterclockwise counterpart.

REFERENCES

R. Bisdorff and J.-L. Marichal, Counting non-isomorphic maximal independent sets of the n-cycle graph, preprint, 2007.

LINKS

R. Bisdorff and J.-L. Marichal, Counting non-isomorphic maximal independent sets of the n-cycle graph, preprint, 2007.

FORMULA

a(n) = Sum(d divides n) A127683(d) = A127685(n) - A127682(n)

CROSSREFS

Cf. A127682, A127683, A127685.

Sequence in context: A008818 A089599 A127683 this_sequence A091434 A034400 A021820

Adjacent sequences: A127683 A127684 A127685 this_sequence A127687 A127688 A127689

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research