A057241 - OEIS

This site is supported by donations to The OEIS Foundation.

A057241

Circuit cost of hardest Boolean functions of n variables; metric: 2-input AND-gates cost 1, NOT is free, fanout is free, inputs are free, no feedback allowed.

0, 0, 3, 6, 10 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	LINKS	`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 (rschroe(AT)sandia.gov), Jan 10 2001`
	EXTENSIONS	`a(5) <= 23.`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 15:50 EST 2012. Contains 205931 sequences.