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.
%I A177741 #8 Mar 19 2018 04:08:05 %S A177741 1,1,9,0,31,8,4,2,308,81,100,70,0,7,3809,578,474,495,454,103,181,103, %T A177741 97,0,63995,11703,11655,9472,9252,1151,8567,2297,1758,1389,1117,2023, %U A177741 104,328,210,128,11,1152784,201685,193899,159485,144516,19625,137561,38453 %N A177741 Triangle in which row n lists the numbers of strong vertex magic total labelings of each 2-regular simple graph on 2n+1 vertices. %C A177741 The 2-regular simple graphs are the disjoint unions of simple cycles (the smallest simple cycle being a triangle). %C A177741 A simple counting argument shows that no 2-regular graph of even order possesses a strong VMTL. %C A177741 The ordering of the graphs in row n is the ordering of the corresponding partitions listed in row 2n+1 of A176210. %H A177741 J. S. Kimberley, <a href="/A177741/b177741.txt">Rows 1..9 of A177741 triangle, flattened</a>. %H A177741 I. D. Gray and J. A. MacDougall, <a href="http://dx.doi.org/10.1016/j.disc.2009.04.031">Vertex-magic labelings of regular graphs. II</a>, Discrete Mathematics, 309 (2009), 5986-5999. %Y A177741 The length of row n is A008483(2n+1). %Y A177741 The row sums are A177742. %Y A177741 The first column is A177743. %K A177741 nonn,tabf %O A177741 1,3 %A A177741 _Jason Kimberley_, May 17 2010