id:A057241 - OEIS Search Results

Search: id:A057241

Displaying 1-1 of 1 results found.

page 1

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
3

0, 0, 3, 6, 10 (list; graph; listen)

	OFFSET	`0,3`
	LINKS	`Comments and examples`
	CROSSREFS	`Cf. A056287, A058759.` `Sequence in context: A103978 A073910 A115251 this_sequence A104617 A104618 A104616` `Adjacent sequences: A057238 A057239 A057240 this_sequence A057242 A057243 A057244`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`Richard Schroeppel (rschroe(AT)sandia.gov), Jan 10 2001`
	EXTENSIONS	`a(5) <= 23.`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research