cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A177742 The number of strong vertex magic total labelings of all 2-regular simple graphs on 2n+1 vertices.

This page as a plain text file.
%I A177742 #8 Mar 19 2018 04:08:12
%S A177742 1,1,9,45,566,6294,125160,2384157,71563278
%N A177742 The number of strong vertex magic total labelings of all 2-regular simple graphs on 2n+1 vertices.
%C A177742 A simple counting argument shows that no 2-regular graph of even order possesses a strong VMTL.
%C A177742 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.
%Y A177742 Row sums of triangle A177741.
%K A177742 hard,more,nonn
%O A177742 1,3
%A A177742 _Jason Kimberley_, May 17 2010