A simple counting argument shows that no 2-regular graph of even order possesses a strong VMTL.
In 2-regular graphs we can swap the interpretation of edges and vertices; so this sequence also gives the number of super edge magic total labelings; hence c.f. the (n,n) diagonal of A060408.
Table of n, a(n) for n=1..9.
Row sums of triangle A177741.
Sequence in context: A145757 A058824 A244302 * A322892 A355175 A352398
Adjacent sequences: A177739 A177740 A177741 * A177743 A177744 A177745
Jason Kimberley, May 17 2010