A324585 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A324585

Minimum BDD size of the middle bit Boolean function of multiplication of two n-bit numbers for optimum orderings of variables.

4, 8, 14, 31, 63, 136, 315, 756, 1717, 4026, 9654, 21931 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,1`
	REFERENCES	`Donald E. Knuth, The Art of Computer Programming, Vol. 4A, section 7.1.4 (Binary Decision Diagrams), p. 248, Addison-Wesley, 2011.`
	LINKS	`Table of n, a(n) for n=1..12.` `Wikipedia, Binary decision diagram`
	CROSSREFS	`Cf. A324586.` `Sequence in context: A153364 A124743 A188575 * A242519 A174554 A360527` `Adjacent sequences: A324582 A324583 A324584 * A324586 A324587 A324588`
	KEYWORD	`nonn,hard,more`
	AUTHOR	`Hugo Pfoertner, Mar 08 2019`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 15:45 EST 2023. Contains 367713 sequences. (Running on oeis4.)