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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

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: A179165 A128836 A061956 * 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 29 21:28 EDT 2017. Contains 287257 sequences.