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.
%I A086154 #18 Mar 13 2025 08:55:48
%S A086154 1,3,126,2220075,33594090947249085,
%T A086154 9812294412288780842726471233974791140221,
%U A086154 747581321238203931168470352555568799370148397202082975882483140118428447896681620077224288595
%N A086154 a(n) = binomial(3^n,2^n).
%C A086154 Upper bound on the number of compressed (irredundant) disjunctive normal forms of Boolean functions with n variables.
%D A086154 G. P. Gavrilov and A. A. Saposhenko, Problems Book in Discrete Mathematics (Hungarian translation), Muszaki Kiado, 1981.
%H A086154 Amiram Eldar, <a href="/A086154/b086154.txt">Table of n, a(n) for n = 0..8</a>
%t A086154 Table[Binomial[3^w, 2^w], {w, 0, 5}]
%o A086154 (PARI) a(n)=binomial(3^n,2^n) \\ _Charles R Greathouse IV_, Dec 19 2011
%o A086154 (Magma) [Binomial(3^n,2^n) : n in [0..7]]; // _Wesley Ivan Hurt_, Apr 20 2021
%Y A086154 Cf. A023265.
%K A086154 nonn
%O A086154 0,2
%A A086154 _Labos Elemer_, Aug 07 2003