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 A360864 #22 Mar 20 2023 09:35:13
%S A360864 0,3,15,111,1076,13870,220520,4185406,92235118,2314204852,65129484278,
%T A360864 2032179006943,69640160993587,2600585852722150,105127528809344785,
%U A360864 4574251821427917425,213171992131468465801,10593983324971249199532,559293301762878627195807,31259896932477899016109585,1844062168535890557437809526
%N A360864 Number of unlabeled connected multigraphs with circuit rank n and degree >= 3 at each node, loops allowed.
%C A360864 The terms up to a(21) were computed by Michael Borinsky and Jos Vermaseren using a program written in FORM. The graphs enumerated by a(n) are called admissible (Borinsky and Vogtmann, 2023).
%H A360864 Michael Borinsky and Karen Vogtmann, <a href="https://arxiv.org/abs/2301.01121">The Euler characteristic of the moduli space of graphs</a>, arXiv:2301.01121 [math.AT], 2023.
%H A360864 Tony Guttmann, <a href="/A360864/a360864.txt">Asymptotics for A360864</a>
%H A360864 Leila Sloman, <a href="https://www.quantamagazine.org/quantum-field-theory-pries-open-mathematical-puzzle-20230216/">Quantum Field Theory Pries Open Mathematical Puzzle</a>, Quanta Magazine, Feb 2023.
%F A360864 a(n) = Sum_{k>=1} A360862(n + k - 1, k).
%Y A360864 Diagonal sums of A360862.
%K A360864 nonn
%O A360864 1,2
%A A360864 _Andrew Howroyd_ and _William P. Orrick_, Feb 24 2023