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 A046082 #5 Apr 05 2015 02:11:48 %S A046082 1,1,1,2,4,19,139,2319,77423,4909331,554491273 %N A046082 Number of ultraconnected graphs on n unlabeled nodes. %C A046082 The ultraconnected graphs are related to the positive definite matrix completion problem. %H A046082 W. W. Barrett, C. R. Johnson and R. Loewy, <a href="http://dx.doi.org/10.1137/S0895479897324573">Critical graphs for the positive definite completion problem.</a>, SIAM J. Matrix Anal. Appl., Vol. 20 (1999), no. 1, 117-130. %K A046082 hard,nonn %O A046082 1,4 %A A046082 Jason Grout (grout(AT)math.byu.edu), May 07 2003 %E A046082 Broken link fixed by _M. F. Hasler_, Apr 05 2015