|
%I #6 Jul 07 2015 21:08:03
%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
|
