This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137202 Number of nodes in the BDD for the hidden weighted bit function h_n under the best possible ordering of variables. 1
 3, 3, 5, 9, 16, 23, 33, 46, 63, 82, 109, 139, 178, 224, 282, 348, 434, 531, 653, 796, 973, 1176, 1433, 1725, 2090 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS In this problem we don't consider "complement bits" to shorten the BDD. The best method presently known to find a(n) takes something like 2.5^n steps. REFERENCES Beate Bollig, Martin LĂ¶bbing, Martin Sauerhoff and Ingo Werner, On the complexity of the hidden weighted bit function for various BDD models, Theoretical Informatics and Applications, 33 (1999), 103-115, Theorem 4.4. Randal E. Bryant, "On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication," IEEE Transactions on Computers C-40 (1991), 205-213. D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4. LINKS EXAMPLE For example, when n=8 the smallest BDD is obtained when one tests first x8 (1 node), then x7 (2 nodes), then x1 (4), then x6 (6), then x2 (9), then x5 (12), then x4 (8), then x3 (2). The total number of nodes is 46, including the two sink nodes. CROSSREFS Cf. A136445. Sequence in context: A321986 A325187 A209083 * A146926 A000198 A202674 Adjacent sequences:  A137199 A137200 A137201 * A137203 A137204 A137205 KEYWORD nonn AUTHOR Don Knuth, Apr 23 2008 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 18:10 EST 2019. Contains 329901 sequences. (Running on oeis4.)