cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 3, 126, 2220075, 33594090947249085, 9812294412288780842726471233974791140221, 747581321238203931168470352555568799370148397202082975882483140118428447896681620077224288595
Offset: 0

Views

Author

Labos Elemer, Aug 07 2003

Keywords

Comments

Upper bound on the number of compressed (irredundant) disjunctive normal forms of Boolean functions with n variables.

References

  • G. P. Gavrilov and A. A. Saposhenko, Problems Book in Discrete Mathematics (Hungarian translation), Muszaki Kiado, 1981.

Crossrefs

Cf. A023265.

Programs