|
Search: id:A069739
|
|
|
| A069739 |
|
Size of the key space for isomorphism verification of circulant graphs of order n. |
|
+0
2
|
|
| 1, 1, 1, 2, 1, 1, 1, 5, 2, 1, 1, 2, 1, 1, 1, 14, 1, 2, 1, 2, 1, 1, 1, 5, 2, 1, 5, 2, 1, 1, 1, 42, 1, 1, 1, 4, 1, 1, 1, 5, 1, 1, 1, 2, 2, 1, 1, 14, 2, 2, 1, 2, 1, 5, 1, 5, 1, 1, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Multiplicative with a(p^m)=Catalan(m) (A000108). Coincides with A066060 up to n=63 except for n=32.
|
|
REFERENCES
|
M. Muzychuk, A solution of the isomorphism problem for circulant graphs, Proc. London Math. Soc. (3) 88 (2004), no. 1, 1-41.
|
|
FORMULA
|
a(n)=prod_p Catalan(m_p) where n=prod_p p^(m_p), p|n prime.
|
|
CROSSREFS
|
Cf. A000108, A066060.
Sequence in context: A099940 A157249 A155586 this_sequence A066060 A008550 A064094
Adjacent sequences: A069736 A069737 A069738 this_sequence A069740 A069741 A069742
|
|
KEYWORD
|
mult,easy,nonn
|
|
AUTHOR
|
Valery Liskovets (liskov(AT)im.bas-net.by), Apr 15 2002
|
|
|
Search completed in 0.002 seconds
|
