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 A241456 #20 Feb 16 2025 08:33:22 %S A241456 0,0,1,1,1,7,31,221,3025,68033 %N A241456 Number of simple connected graphs g on n nodes with |Aut(g)| = 6. %H A241456 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A241456 Travis Hoppe and Anna Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014. %H A241456 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphAutomorphism.html">Graph Automorphism</a> %Y A241456 Cf. Values of |Aut(g)| for simple connected graphs, A124059, A241454, A241455, A241456, A241457, A241458, A241459, A241460, A241461, A241462, A241463, A241464, A241465, A241466, A241467, A241468, A241469, A241470, A241471. %K A241456 nonn,more %O A241456 1,6 %A A241456 _Travis Hoppe_ and _Anna Petrone_, Apr 23 2014