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 A241905 #14 May 21 2014 00:28:33 %S A241905 1,1,1,4,13,83 %N A241905 The number of connected graphs G on n vertices such that every unlabeled automorphism of the reduced graph of G is a labeled automorphism of the reduced graph of G. %D A241905 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford University Press (1999). %H A241905 J. P. McSorley and T. D. Porter, <a href="http://lagrange.math.siu.edu/mcsorley/papers/seqJJFIN.pdf">K_p Removable Sequences of Graphs</a>, Journal of Combinatorial Mathematics and Combinatorial Computing, 45, 43-62, (2003). %Y A241905 Cf. A004110, A004108, A241904 (similar but graphs not necessarily connected). %K A241905 nonn,more %O A241905 1,4 %A A241905 _Dayana Adatorwovor_, May 01 2014