|
Search: id:A086154
|
|
| |
|
| 1, 3, 126, 2220075, 33594090947249085, 9812294412288780842726471233974791140221, 747581321238203931168470352555568799370148397202082975882483140118428447896681620077224288595
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Upper bound on the number of compressed [irredundant] disjunctive normal forms of Boolean functions with n variables.
|
|
REFERENCES
|
Gavrilov G.P. and Saposhenko A.A.: Problems Book in Discrete Mathematics. [Hungarian translation], Muszaki Kiado,1981.
|
|
MATHEMATICA
|
Table[Binomial[3^w, 2^w], {w, 1, 5}]
|
|
CROSSREFS
|
Cf. A023265.
Sequence in context: A085531 A130614 A114877 this_sequence A133122 A139936 A142007
Adjacent sequences: A086151 A086152 A086153 this_sequence A086155 A086156 A086157
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Aug 07 2003
|
|
|
Search completed in 0.002 seconds
|
