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 A185213 #23 May 20 2020 14:31:48 %S A185213 0,0,0,0,0,0,0,0,0,0,0,0,1,13,8037887,945095928322681, %T A185213 187549741420313256356540,66398446859255608487987488813721, %U A185213 43100445877221052008718432480116589483823 %N A185213 Number of disconnected 11-regular graphs with 2n nodes. %H A185213 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a> %Y A185213 11-regular simple graphs: A014384 (connected), this sequence (disconnected). %Y A185213 Disconnected regular simple graphs: A068932 (any degree), A068933 (triangular array), specified degree k: A165652 (k=2), A165653 (k=3), A033483 (k=4), A165655 (k=5), A165656 (k=6), A165877 (k=7), A165878 (k=8), A185293 (k=9), A185203 (k=10), this sequence (k=11). %K A185213 nonn,hard,more %O A185213 0,14 %A A185213 _Jason Kimberley_, Jan 26 2012 %E A185213 a(15)-a(18) from _Andrew Howroyd_, May 20 2020