login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177742 The number of strong vertex magic total labelings of all 2-regular simple graphs on 2n+1 vertices. 1
1, 1, 9, 45, 566, 6294, 125160, 2384157, 71563278 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..9.

CROSSREFS

Row sums of triangle A177741.

Sequence in context: A145757 A058824 A244302 * A322892 A355175 A352398

Adjacent sequences:  A177739 A177740 A177741 * A177743 A177744 A177745

KEYWORD

hard,more,nonn

AUTHOR

Jason Kimberley, May 17 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 29 17:18 EDT 2022. Contains 357090 sequences. (Running on oeis4.)