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 A087114 #14 Feb 16 2025 08:32:50 %S A087114 1,1,2,1,3,1,4,1,6,1,8,1,18,1,40,1,230,1,4296,1,431206,1,162267272,1, %T A087114 201636689771,1,777816803942186,1,9865957936943931964,1, %U A087114 395886667549681689591841,1,53716176608076643470621234239,1,23524515269630339982914646821899537,1,35682168849414944013547274452501768506834,1 %N A087114 Number of regular bipartite simple graphs on n nodes. %C A087114 A graph must be regular and bipartite to be a semisymmetric graph. %H A087114 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SemisymmetricGraph.html">Semisymmetric Graph</a> %F A087114 a(2*n + 1) = 1, a(2*n) = A008324(n). - _Andrew Howroyd_, Sep 05 2018 %Y A087114 Cf. A008323, A008324, A008327. %K A087114 nonn %O A087114 0,3 %A A087114 _Eric W. Weisstein_, Aug 13 2003 %E A087114 a(10)-a(19) from _Andrew Howroyd_, Sep 05 2018 %E A087114 a(0)=1 prepended and a(20) onwards added by _Andrew Howroyd_, Feb 21 2024