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 A005617 M1985 #41 Apr 04 2025 11:06:14 %S A005617 2,2,10,122,2554,75386,2865370,133191386,7319102842,464161640378, %T A005617 33365010466330,2680736773291418,238072159069838266, %U A005617 23157446685020355194,2448496007747625525850,279603850797891071481434,34294941015273001096282618 %N A005617 Number of non-degenerate fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates. %D A005617 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005617 Andrew Howroyd, <a href="/A005617/b005617.txt">Table of n, a(n) for n = 0..200</a> %H A005617 E. A. Bender and J. T. Butler, <a href="/A005612/a005612.pdf">Asymptotic approximations for the number of fanout-free functions</a>, IEEE Trans. Computers, 27 (1978), 1180-1183. (Annotated scanned copy) %H A005617 J. T. Butler, <a href="/A005607/a005607_1.pdf">Letter to N. J. A. Sloane, Dec. 1978</a>. %H A005617 K. L. Kodandapani and S. C. Seth, <a href="http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675103">On combinational networks with restricted fan-out</a>, IEEE Trans. Computers, 27 (1978), 309-318. (<a href="/A005736/a005736.pdf">Annotated scanned copy</a>) %H A005617 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a> %F A005617 E.g.f.: 2 + 2*Series_Reversion(log(1 + 3*x + 2*x^2) - 2*x - 2*x^3/3). - _Andrew Howroyd_, Apr 04 2025 %o A005617 (PARI) seq(n)=Vec(2*serlaplace(1 + serreverse(log(1 + 3*x + 2*x^2 + O(x*x^n)) - 2*x - 2*x^3/3))) \\ _Andrew Howroyd_, Apr 04 2025 %Y A005617 Cf. A005616, A005740, A005741. %K A005617 nonn %O A005617 0,1 %A A005617 _N. J. A. Sloane_ %E A005617 a(0) prepended and more terms from _Sean A. Irvine_, Jul 21 2016