Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Sep 20 2023 13:20:11
%S 1,2,25,1000,83521,11881376,2565726409,781250000000,318644812890625,
%T 167619550409708032,110462212541120451001,89116503268220597577728,
%U 86380562306022715087890625,99045780329059370000000000000,132595005683061140853836321918569
%N a(n) = (n^2+1)^n.
%H Winston de Greef, <a href="/A014050/b014050.txt">Table of n, a(n) for n = 0..215</a>
%F a(n) = Sum_{k=0..n} binomial(n,k)*n^(2*k). - _Vaclav Kotesovec_, Oct 16 2016
%t Table[(n^2+1)^n,{n,0,20}] (* _Harvey P. Dale_, Sep 20 2023 *)
%Y Cf. A136516.
%K nonn
%O 0,2
%A _N. J. A. Sloane_.