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 A136393 #16 Feb 06 2023 10:05:55
%S A136393 1,3,36,2925,1663740,6774333588,204208594169580,47025847059877940202,
%T A136393 84798009611754271531960140,1219731290030242386267605060168700,
%U A136393 141916030352038369973126553950792759280336
%N A136393 a(n) = C(3^n,n).
%H A136393 Vincenzo Librandi, <a href="/A136393/b136393.txt">Table of n, a(n) for n = 0..45</a>
%F A136393 G.f.: A(x) = Sum_{n>=0} log(1 + 3^n*x)^n / n!.
%F A136393 a(n) = (1/n!) * Sum_{k=0..n} Stirling1(n, k) * 3^(n*k). - _Paul D. Hanna_, Feb 05 2023
%F A136393 a(n) ~ 3^(n^2)/n!. - _Vaclav Kotesovec_, Jul 02 2016
%t A136393 Table[Binomial[3^n,n], {n,0,10}] (* _Vaclav Kotesovec_, Jul 02 2016 *)
%o A136393 (PARI) a(n)=binomial(3^n,n)
%o A136393 (PARI) /* G.f. A(x) as Sum of Series: */
%o A136393 a(n)=polcoeff(sum(k=0,n,log(1+3^k*x +x*O(x^n))^k/k!),n)
%o A136393 (PARI) {a(n) = (1/n!) * sum(k=0, n, stirling(n, k, 1) * 3^(n*k) )}
%o A136393 for(n=0, 20, print1(a(n), ", ")) \\ _Paul D. Hanna_, Feb 05 2023
%o A136393 (Magma) [Binomial(3^n,n): n in [0..25]]; // _Vincenzo Librandi_, Sep 13 2016
%Y A136393 Cf. A014070 (C(2^n, n)).
%K A136393 nonn
%O A136393 0,2
%A A136393 _Paul D. Hanna_, Dec 28 2007