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 A000083 M1191 N0461 #36 Feb 24 2025 22:44:45 %S A000083 1,1,1,2,4,9,23,63,188,596,1979,6804,24118,87379,322652,1209808, %T A000083 4596158,17657037,68497898,268006183,1056597059,4193905901, %U A000083 16748682185,67258011248,271452424286,1100632738565,4481533246014,18319020658537,75152228262785,309337095953934 %N A000083 Number of mixed Husimi trees with n nodes; or polygonal cacti with bridges. %D A000083 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A000083 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A000083 Christian G. Bower, <a href="/A000083/b000083.txt">Table of n, a(n) for n = 0..500</a> %H A000083 G. W. Ford and G. E. Uhlenbeck, <a href="http://www.jstor.org/stable/89494">Combinatorial problems in the theory of graphs III</a>, Proc. Nat. Acad. Sci. USA, 42 (1956), 529-535. %H A000083 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CactusGraph.html">Cactus Graph</a> %H A000083 <a href="/index/Ca#cacti">Index entries for sequences related to cacti</a> %H A000083 <a href="/index/Tra#trees">Index entries for sequences related to trees</a> %F A000083 G.f.: A(x) = B(x) + C(x) - B(x)*D(x), where B, C, D respectively are g.f.s of A000237, A035349, A035350. - _Christian G. Bower_, Nov 15 1998 %Y A000083 Cf. A000237, A000314, A035082, A035349-A035357. %K A000083 nonn %O A000083 0,4 %A A000083 _N. J. A. Sloane_ %E A000083 More terms from _Christian G. Bower_, Nov 15 1998