A086154 a(n) = C(3^n,2^n).

1, 3, 126, 2220075, 33594090947249085, 9812294412288780842726471233974791140221, 747581321238203931168470352555568799370148397202082975882483140118428447896681620077224288595

Offset

0,2

Comments

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.

Links

Table of n, a(n) for n=0..6.

Mathematica

Table[Binomial[3^w, 2^w], {w, 1, 5}]

Prog

(PARI) a(n)=binomial(3^n, 2^n) \\ Charles R Greathouse IV, Dec 19 2011
(Magma) [Binomial(3^n, 2^n) : n in [0..7]]; // Wesley Ivan Hurt, Apr 20 2021

Crossrefs

Cf. A023265.

Sequence in context: A157592 A213988 A159319 * A133122 A139936 A221637

Adjacent sequences: A086151 A086152 A086153 * A086155 A086156 A086157

Keyword

nonn

Author

Labos Elemer, Aug 07 2003

Status

approved