OFFSET
0,2
COMMENTS
Also the number of digraphical necklaces with n vertices. A digraphical necklace is defined to be a directed graph that is minimal among all n rotations of the vertices. Alternatively, it is an equivalence class of directed graphs under rotation of the vertices. These are a kind of partially labeled digraphs. - Gus Wiseman, Mar 04 2019
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..57
Peter Kagey and William Keehn, Counting tilings of the n X m grid, cylinder, and torus, arXiv:2311.13072 [math.CO], 2023. See p. 3.
FORMULA
a(n) = (1/n)*Sum_{ d divides n } phi(d)*2^(n^2/d) for n > 0, a(0) = 1.
EXAMPLE
From Gus Wiseman, Mar 04 2019: (Start)
Inequivalent representatives of the a(2) = 10 digraphical necklace edge-sets:
{}
{(1,1)}
{(1,2)}
{(1,1),(1,2)}
{(1,1),(2,1)}
{(1,1),(2,2)}
{(1,2),(2,1)}
{(1,1),(1,2),(2,1)}
{(1,1),(1,2),(2,2)}
{(1,1),(1,2),(2,1),(2,2)}
(End)
MATHEMATICA
Table[Fold[ #1+EulerPhi[ #2] 2^(n^2 /#2)&, 0, Divisors[n]]/n, {n, 16}]
(* second program *)
rotdigra[g_, m_]:=Sort[g/.k_Integer:>If[k==m, 1, k+1]];
Table[Length[Select[Subsets[Tuples[Range[n], 2]], #=={}||#==First[Sort[Table[Nest[rotdigra[#, n]&, #, j], {j, n}]]]&]], {n, 0, 4}] (* Gus Wiseman, Mar 04 2019 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Yuval Dekel (dekelyuval(AT)hotmail.com), Jul 27 2003
EXTENSIONS
More terms from Wouter Meeussen, Jul 29 2003
a(0)=1 prepended by Gus Wiseman, Mar 04 2019
STATUS
approved