id:A130678 - OEIS Search Results

Search: id:A130678

Displaying 1-1 of 1 results found.

page 1

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

+0
1

2, 2, 74, 11666, 5343338, 5664481490, 11994898758122, 45768613243457234 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`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.`
	CROSSREFS	`Sequence in context: A086204 A037292 A028372 this_sequence A133295 A055470 A003110` `Adjacent sequences: A130675 A130676 A130677 this_sequence A130679 A130680 A130681`
	KEYWORD	`nonn`
	AUTHOR	`D. E. Knuth, Jun 29 2007`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.