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 A234971 #27 Jan 04 2021 08:44:04
%S A234971 1,2,37,1000,38401,1896876,112124629,7679202336,595411451905,
%T A234971 51348552829300,4861414171762501,500163335120177136,
%U A234971 55466421261812540929,6585829687114412247800,832587068884779776276661,111541424966889778569909376,15771414153994526723881828353
%N A234971 a(n) = Sum_{k=0..n} n^k * binomial(n,k)^4.
%C A234971 In general, Sum_{k=0..n} n^k * binomial(n,k)^p is asymptotic to (1+n^(1/p))^(n*p+p-1) / sqrt(p * (2*Pi)^(p-1) * n^(p-1/p)).
%H A234971 Vincenzo Librandi, <a href="/A234971/b234971.txt">Table of n, a(n) for n = 0..200</a> [a(0)=1 inserted by _Georg Fischer_, Jan 04 2020]
%H A234971 Vaclav Kotesovec, <a href="http://www.kotesovec.cz/math_articles/kotesovec_binomial_asymptotics.pdf">Asymptotic of a sums of powers of binomial coefficients * x^k</a>, 2012
%F A234971 a(n) ~ (1+n^(1/4))^(4*n+3) / (4*sqrt(2) * Pi^(3/2) * n^(15/8)).
%F A234971 a(n) = hypergeom([-n, -n, -n, -n], [1, 1, 1], n). - _Peter Luschny_, Dec 22 2020
%p A234971 a := n -> hypergeom([-n, -n, -n, -n], [1, 1, 1], n):
%p A234971 seq(simplify(a(n)), n=0..16); # _Peter Luschny_, Dec 22 2020
%t A234971 Table[Sum[If[n==k==0, 1, n^k]*Binomial[n, k]^4, {k, 0, n}], {n, 0, 20}] (* offset adapted by _Georg Fischer_, Jan 04 2021 *)
%o A234971 (PARI) a(n) = sum(k=0, n, n^k * binomial(n,k)^4); \\ _Michel Marcus_, Jan 04 2021
%Y A234971 Cf. A187021, A241247.
%K A234971 nonn,easy
%O A234971 0,2
%A A234971 _Vaclav Kotesovec_, Apr 19 2014
%E A234971 a(0) = 1 prepended by _Peter Luschny_, Dec 22 2020