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

1, 1, 4, 7, 12

Offset

1,3

References

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

Links

Table of n, a(n) for n=1..5.

Crossrefs

Cf. A056287.

Sequence in context: A128836 A061956 A327429 * A072732 A270684 A083487

Adjacent sequences: A178936 A178937 A178938 * A178940 A178941 A178942

Keyword

nonn,nice,hard,more

Author

Russ Cox, Dec 30 2010

Status

approved