login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178939 Maximal AND-OR-XOR formula complexity (operator count) for n-input Boolean functions 1

%I

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 18 18:17 EDT 2017. Contains 290733 sequences.