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 A057848 #21 Mar 01 2023 06:57:22 %S A057848 0,1,60,2520,453600,59875200,13621608000,8009505504000, %T A057848 3123380227968000,1832279324908032000,2054813830468439040000, %U A057848 1665031453088810526720000,1925086583971531588608000000 %N A057848 Number of 1-connected claw-free cubic graphs with 2n nodes. %H A057848 Sean A. Irvine, <a href="/A057848/b057848.txt">Table of n, a(n) for n = 1..100</a> (terms 1..30 from G.-B. Chae, term 30 corrected by Sean A. Irvine) %H A057848 G.-B. Chae, <a href="http://myhome.hanafos.com/~1234chae/myindex.htm">Home page</a> %H A057848 G.-B. Chae, <a href="https://doi.org/10.1016/j.disc.2007.09.034">Counting labeled claw-free cubic graphs by connectivity</a>, Discrete Mathematics 308 (2008) 5136-5143. %H A057848 G.-B. Chae, E. M. Palmer and R. W. Robinson, <a href="/A058929/a058929.pdf">Computing the number of Claw-free Cubic Graphs with given Connectivity</a>, Preprint, 2000. (Annotated scanned copy) %Y A057848 Cf. A058929, A058930, A058931, A058932. %K A057848 nonn %O A057848 1,3 %A A057848 _N. J. A. Sloane_, Jan 12 2001