Maximal AND-OR formula complexity (operator count) for n-input Boolean functions.
A056287
Maximal AND-OR formula complexity (operator count) for n-input Boolean functions.
Terms
- a(0) =1a(1) =3a(2) =9a(3) =15a(4) =28
External references
- oeis: A056287
A056287
Maximal AND-OR formula complexity (operator count) for n-input Boolean functions.