A130678 - 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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A130678

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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

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

REFERENCES

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

LINKS

Table of n, a(n) for n=1..8.

CROSSREFS

Sequence in context: A231808 A306063 A028372 * A370736 A230054 A303569

Adjacent sequences: A130675 A130676 A130677 * A130679 A130680 A130681

KEYWORD

nonn,more

AUTHOR

Don Knuth, Jun 29 2007

STATUS

approved