The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A040996 Maximum number of distinct functions at the bottom of a Boolean (or Binary) Decision Diagram (or BDD) with negation by pointer complementation. 1
 1, 6, 120, 32640, 2147450880, 9223372034707292160, 170141183460469231722463931679029329920, 57896044618658097711785492504343953926464851149359812787997104700240680714240 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS At 0, the last variable, the only choice is (t, f) because the first entry is always uncomplemented and the 2nd must be different. At level 1, the 2nd to last variable, the first entry is either t or a pointer to a following level (0) and the 2nd entry is either of these or its negation, except it may not equal the first entry. At level n, the n-th to last variable, the first entry is either t or a pointer to one of the following levels' functions and the second entry is any of these or its negation, but not equal to the first entry. REFERENCES Cezar Campeanu, Nelma Moreira, Rogerio Reis, Expected Compression Ratio for DFCA: experimental average case analysis, Technical Report Series: DCC-2011-07, December 2011, Departamento de Ciencia de Computadores, Universidade do Porto; http://www.dcc.fc.up.pt/dcc/Pubs/TReports/TR11/dcc-2011-07.pdf LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..12 David L. Dill, Higher-level verification with BDDs FORMULA a(n) = (S(n-1) + 1) * (2*S(n-1) + 1) where S(n-1) = Sum_{k

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 May 31 22:35 EDT 2020. Contains 334756 sequences. (Running on oeis4.)