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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057241 Circuit cost of the hardest Boolean function of n variables; metric: 2-input AND-gates cost 1, NOT is free, fanout is free, inputs are free, no feedback allowed. 3
0, 0, 3, 6, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(5) <= 23.

LINKS

Table of n, a(n) for n=0..4.

Richard Schroeppel, Comments and examples

CROSSREFS

Cf. A056287, A058759.

Sequence in context: A103978 A073910 A115251 * A104617 A104618 A104616

Adjacent sequences:  A057238 A057239 A057240 * A057242 A057243 A057244

KEYWORD

nonn,nice,hard,more

AUTHOR

Richard Schroeppel, Jan 10 2001

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 June 22 23:15 EDT 2017. Contains 288633 sequences.