Location via proxy:   [ UP ]   [Report a bug]   [Manage cookies]    No cookies    No scripts    No ads    No referrer    Show this form

login

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

 

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 1, 1, 4, 7, 12 (list; graph; refs; listen; history; text; internal format) 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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 19 07:15 EDT 2024. Contains 375284 sequences. (Running on oeis4.)