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 A178939 #10 May 05 2021 10:38:44 %S A178939 1,1,4,7,12 %N A178939 Maximal AND-OR-XOR formula complexity (operator count) for n-input Boolean functions. %D A178939 D. E. Knuth, The Art of Computer Programming, Volume 4A, Section 7.1.2. %Y A178939 Cf. A056287. %K A178939 nonn,nice,hard,more %O A178939 1,3 %A A178939 _Russ Cox_, Dec 30 2010