A178939 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A178939

Maximal AND-OR-XOR formula complexity (operator count) for n-input Boolean functions.

%I #10 May 05 2021 10:38:44

%S 1,1,4,7,12

%N Maximal AND-OR-XOR formula complexity (operator count) for n-input Boolean functions.

%D D. E. Knuth, The Art of Computer Programming, Volume 4A, Section 7.1.2.

%Y Cf. A056287.

%K nonn,nice,hard,more

%O 1,3

%A _Russ Cox_, Dec 30 2010