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 A326271 #17 Jul 06 2019 09:21:38
%S A326271 1,3,39,948,34869,1757163,114320118,9226773993,897658726215,
%T A326271 103005144933870,13705015429716807,2085418048857405375,
%U A326271 358813807291982519184,69146346672687725451039,14803634157756603606592167,3496440993213535696041009924,905508769623362527769907535857,255762146004426658313683324505247,78413243604482526944814375388910526,25983968388767783226046397856822603645
%N A326271 E.g.f.: Sum_{n>=0} 3^n * (exp(n*x) - 1)^n / n!.
%C A326271 More generally, the following sums are equal:
%C A326271 (1) Sum_{n>=0} (p + q^n)^n * r^n/n!,
%C A326271 (2) Sum_{n>=0} q^(n^2) * exp(p*q^n*r) * r^n/n!;
%C A326271 here, q = exp(x) with p = -1, r = 3.
%C A326271 In general, let F(x) be a formal power series in x such that F(0)=1, then
%C A326271 Sum_{n>=0} m^n * F(q^n*r)^b * log( F(q^n*r) )^n / n! =
%C A326271 Sum_{n>=0} r^n * [y^n] F(y)^(m*q^n + p);
%C A326271 here, F(x) = exp(x), q = exp(x), p = -1, r = 3, m = 1.
%H A326271 Paul D. Hanna, <a href="/A326271/b326271.txt">Table of n, a(n) for n = 0..300</a>
%F A326271 E.g.f.: Sum_{n>=0} 3^n * (exp(n*x) - 1)^n / n!.
%F A326271 E.g.f.: Sum_{n>=0} 3^n * exp(n^2*x) * exp( -3*exp(n*x) ) / n!.
%F A326271 O.g.f.: Sum_{n>=0} 3^n * n^n * x^n / Product_{k=1..n} (1 - n*k*x).
%F A326271 a(n) = Sum_{k=0..n} 3^k * k^n * Stirling2(n,k).
%e A326271 E.g.f.: A(x) = 1 + 3*x + 39*x^2/2! + 948*x^3/3! + 34869*x^4/4! + 1757163*x^5/5! + 114320118*x^6/6! + 9226773993*x^7/7! + 897658726215*x^8/8! + 103005144933870*x^9/9! + ...
%e A326271 such that
%e A326271 A(x) = 1 + 3*(exp(x) - 1) + 3^2*(exp(2*x) - 1)^2/2! + 3^3*(exp(3*x) - 1)^3/3! + 3^4*(exp(4*x) - 1)^4/4! + 3^5*(exp(5*x) - 1)^5/5! + 3^6*(exp(6*x) - 1)^6/6! + ...
%e A326271 also
%e A326271 A(x) = exp(-3) + 3*exp(x)*exp(-3*exp(x)) + 3^2*exp(4*x)*exp(-3*exp(2*x))/2! + 3^3*exp(9*x)*exp(-3*exp(3*x))/3! + 3^4*exp(16*x)*exp(-3*exp(4*x))/4! + 3^5*exp(25*x)*exp(-3*exp(5*x))/5! + 3^6*exp(36*x)*exp(-3*exp(6*x))/6! + ...
%e A326271 ORDINARY GENERATING FUNCTION.
%e A326271 O.g.f.: B(x) = 1 + 3*x + 39*x^2 + 948*x^3 + 34869*x^4 + 1757163*x^5 + 114320118*x^6 + 9226773993*x^7 + 897658726215*x^8 + 103005144933870*x^9 + ...
%e A326271 such that
%e A326271 B(x) = 1 + 3*x/(1-x) + 3^2*2^2*x^2/((1-2*x)*(1-4*x)) + 3^3*3^3*x^3/((1-3*x)*(1-6*x)*(1-9*x)) + 3^4*4^4*x^4/((1-4*x)*(1-8*x)*(1-12*x)*(1-16*x)) + 3^5*5^5*x^5/((1-5*x)*(1-10*x)*(1-15*x)*(1-20*x)*(1-25*x)) + ...
%o A326271 (PARI) {a(n) = sum(k=0, n, 3^k * k^n * stirling(n, k, 2) )}
%o A326271 for(n=0, 30, print1(a(n), ", "))
%o A326271 (PARI) /* E.g.f.: Sum_{n>=0} 3^n * (exp(n*x) - 1)^n / n! */
%o A326271 {a(n) = n! * polcoeff(sum(m=0, n, 3^m * (exp(m*x +x*O(x^n)) - 1)^m / m!), n)}
%o A326271 for(n=0, 30, print1(a(n), ", "))
%o A326271 (PARI) /* O.g.f.: Sum_{n>=0} 3^n * n^n * x^n / Product_{k=1..n} (1 - n*k*x) */
%o A326271 {a(n) = polcoeff(sum(m=0, n, 3^m * m^m * x^m / prod(k=1, m, 1-m*k*x +x*O(x^n))), n)}
%o A326271 for(n=0, 30, print1(a(n), ", "))
%Y A326271 Cf. A108459, A326270, A326288.
%K A326271 nonn
%O A326271 0,2
%A A326271 _Paul D. Hanna_, Jun 28 2019