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 A005530 M1711 #48 Oct 07 2017 02:58:37
%S A005530 2,6,38,942,325262,25768825638,129127208425774833206,
%T A005530 2722258935367507707190488025630791841374
%N A005530 Number of Boolean functions of n variables from Post class F(8,inf); number of degenerate Boolean functions of n variables.
%D A005530 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D A005530 I. Tomescu, Introducere in Combinatorica. Editura Tehnica, Bucharest, 1972, p. 129.
%H A005530 Alois P. Heinz, <a href="/A005530/b005530.txt">Table of n, a(n) for n = 1..12</a>
%H A005530 T. E. Allen, J. Goldsmith, N. Mattei, <a href="http://cs.engr.uky.edu/~goldsmit/papers/gen-cpnets.pdf">Counting, Ranking, and Randomly Generating CP-nets</a>, 2014.
%H A005530 R. K. Guy, <a href="/A003320/a003320_1.pdf">Letter to N. J. A. Sloane, Mar 1974</a>
%H A005530 Y. Raekow and K. Ziegler, <a href="http://tinyurl.com/3orssf6">A taxonomy of non-cooperatively computable functions</a>, Presented at WEWoRC 2011 (link to conference record).
%H A005530 I. Tomescu, <a href="/A003320/a003320_4.pdf">Excerpts from "Introducese in Combinatorica" (1972)</a>, pp. 230-1, 44-5, 128-9. (Annotated scanned copy)
%H A005530 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%F A005530 a(n) = Sum_{j=1..n} (-1)^(j+1)*binomial(n,j)*2^(2^(n-j)).
%t A005530 Sum[(-1)^(j + 1) Binomial[n, j] 2^2^(n - j), {j, 1, n}]
%o A005530 (PARI) for(n=1,10, print1(sum(j=1,n, (-1)^(j+1)*binomial(n,j)*2^(2^(n-j))), ", ")) \\ _G. C. Greubel_, Oct 06 2017
%Y A005530 a(n) = 2^(2^n) - A000371(n). Cf. A036239, A036240.
%K A005530 nonn,easy,nice
%O A005530 1,1
%A A005530 _N. J. A. Sloane_, _R. K. Guy_
%E A005530 More terms from _Vladeta Jovovic_, Goran Kilibarda