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 A054916 #14 May 20 2020 02:43:16 %S A054916 1,0,0,0,1,2,2,12,18,158,532,18956,389418,50314722,2942198334, %T A054916 1698517035792,442786966113484,649978211591577760, %U A054916 429712868499646362046,2886054228478618206288948,8835589045148342277740379344,152929279364927228928017067050204,1207932509391069805495173186013097090,99162609848561525198669168626676490270856 %N A054916 Number of connected unlabeled regular graphs with n nodes such that complement is also connected. %H A054916 V. A. Liskovets, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/LISK/Derseq.html">Some easily derivable sequences</a>, J. Integer Sequences, 3 (2000), #00.2.2. %F A054916 a(n) = 2*A005177(n)-A005176(n) = A005177(n)-A068932(n). %Y A054916 Cf. A005176, A005177, A068932. %K A054916 nonn,hard %O A054916 1,6 %A A054916 _N. J. A. Sloane_, May 23 2000 %E A054916 Terms a(11)-a(16) appended, journal link changed to article link, and second formula included, by _Jason Kimberley_, Oct 24 2009 %E A054916 a(17)-a(24) from _Andrew Howroyd_, May 19 2020