Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049309
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049309 Number of nonisomorphic self-complementary circulant digraphs (Cayley digraphs for the cyclic group) of order 2n-1. +0
4
1, 1, 2, 2, 3, 4, 8, 20, 20, 30, 88, 94, 214 (list; graph; listen)
OFFSET

1,3

COMMENT

There is an easy formula for prime orders. Formulae are also known for square-free and prime-squared orders. The subsequent values for orders 29,31 are 596,1096.

LINKS

V. A. Liskovets, Some identities for enumerators of circulant graphs.

V. A. Liskovets and R. Poeschel, On the enumeration of circulant graphs of prime-power and square-free orders

R. Poeschel, Publications

CROSSREFS

Cf. A049288, A049289, A049297.

Sequence in context: A032243 A153922 A153943 this_sequence A022405 A093927 A067088

Adjacent sequences: A049306 A049307 A049308 this_sequence A049310 A049311 A049312

KEYWORD

nice,nonn

AUTHOR

V. A. Liskovets (liskov(AT)im.bas-net.by)

EXTENSIONS

Further values for (twice) square-free and (twice) prime-squared orders can be found in the Liskovets reference.

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research