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 A099753 #9 Sep 08 2022 08:45:15
%S A099753 1,27,625,16807,531441,19487171,815730721,38443359375,2015993900449,
%T A099753 116490258898219,7355827511386641,504036361936467383,
%U A099753 37252902984619140625,2954312706550833698643,250246473680347348787521,22550116774162743178682911,2154025884392726618070214209
%N A099753 a(n) = (2*n+1)^(n+2).
%H A099753 G. C. Greubel, <a href="/A099753/b099753.txt">Table of n, a(n) for n = 0..345</a>
%F A099753 From _Peter Bala_, Aug 06 2012: (Start)
%F A099753 E.g.f.: d^2/dx^2{(2*x/T(2*x))^(3/2)*1/(1 - T(2*x))} = 1 + 27*x + 625*x^2/2! + ..., where T(x) is the tree function sum {n >=1} n^(n-1)*x^n/n! of A000169.
%F A099753 For r = 0, 1, 2, ..., the e.g.f. for the sequence (2*n+1)^(n+r) can be expressed in terms of the function U(z) = sum {n >= 0} (2*n+1)^(n-1)*z^(2*n+1)/(2^n*n!). See A214406 for details. In the present case, r = 2, and the resulting e.g.f. is 1/z*U(z)*(1 + 8*U(z)^2 + 3*U(z)^4)/(1 - U(z)^2)^5 taken at z = sqrt(2*x).
%F A099753 (End)
%p A099753 seq((2*n+1)^(n+2), n=0..30); # _G. C. Greubel_, Sep 03 2019
%t A099753 Table[(2*n+1)^(n+2), {n,0,30}] (* _G. C. Greubel_, Sep 03 2019 *)
%o A099753 (PARI) vector(30, n, (2*n-1)^(n+1)) \\ _G. C. Greubel_, Sep 03 2019
%o A099753 (Magma) [(2*n+1)^(n+2): n in [0..30]]; // _G. C. Greubel_, Sep 03 2019
%o A099753 (Sage) [(2*n+1)^(n+2) for n in (0..30)] # _G. C. Greubel_, Sep 03 2019
%o A099753 (GAP) List([0..30], n-> (2*n+1)^(n+2)); # _G. C. Greubel_, Sep 03 2019
%Y A099753 Cf. A000169, A085527, A085528, A214406.
%K A099753 nonn,easy
%O A099753 0,2
%A A099753 Kari Lajunen (Kari.Lajunen(AT)Welho.com), Nov 11 2004
%E A099753 Terms a(13) onward added by _G. C. Greubel_, Sep 03 2019