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 A266478 #10 Feb 03 2016 17:03:55
%S A266478 1,0,2,5,31,136,1040
%N A266478 Number of n-vertex simple graphs G_n for which n divides the number of labeled copies of G_n.
%C A266478 Let G_n be an n-vertex simple graph, with a(G_n) automorphisms. Then l(G_n) = n!/a(G_n) is the number of labeled copies of G_n. So a(n) is the number of G_n for which n divides l(G_n).
%D A266478 John P. McSorley, Smallest labelled class (and largest automorphism group) of a tree T_{s,t} and good labellings of a graph, preprint, (2016).
%D A266478 R. C. Read, R. J. Wilson, An Atlas of Graphs, Oxford Science Publications, Oxford University Press, (1998).
%e A266478 If n=3 then both G_3 = K_1 union K_2 and its complement have a(G_3)=2, so l(G_3) = 3!/2 = 3, and so 3 divides l(G_3); no other graphs G_3 satisfy this, so a(3) = 2.
%Y A266478 Cf. A000088.
%K A266478 nonn,hard,more
%O A266478 1,3
%A A266478 _John P. McSorley_, Dec 29 2015