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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130678 Number of reduced BDDs (binary decision diagrams) with two nodes on each level except the top. 0

%I

%S 2,2,74,11666,5343338,5664481490,11994898758122,45768613243457234

%N Number of reduced BDDs (binary decision diagrams) with two nodes on each level except the top.

%C Can be computed in polynomial time, but probably not "easily".

%D D. E. Knuth, The Art of Computer Programming, Volume 4, to appear as an exercise in Section 7.1.4.

%K nonn,more

%O 1,1

%A _Don Knuth_, Jun 29 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 10:00 EDT 2021. Contains 345162 sequences. (Running on oeis4.)