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 A192516 #14 May 31 2018 05:11:56 %S A192516 1,1,2,8,62,739,11660,229003,5487341,157413957,5310060277, %T A192516 207442849742,9266622204859,468316344074444,26534795158872607, %U A192516 1672482335988644162,116473621430584439236,8908899406447047324336,744489132650874081005467 %N A192516 Number of line graphs on [1,...,n]. %H A192516 Peter Cameron, Thomas Prellberg, Dudley Stark, <a href="http://dx.doi.org/10.1016/j.disc.2008.09.008">Asymptotic enumeration of 2-covers and line graphs</a>, Discrete Math. 310 (2010), no. 2, 230-240 (see l_n). %F A192516 E.g.f. = exp(-x^3/6-x^4/6-x^5/8-x^6/48)*U(x), where U(x) is the e.g.f. for A014500. %Y A192516 Cf. A014500. %K A192516 nonn %O A192516 0,3 %A A192516 _N. J. A. Sloane_, Jul 03 2011