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 A375730 #27 Sep 13 2024 12:20:48
%S A375730 2,5,13,43,281,3161,46705,823607,16777297,387420589,10000000121,
%T A375730 285311670755,8916100448425,302875106592449,11112006825558241,
%U A375730 437893890380859631,18446744073709551905,827240261886336764501,39346408075296537575785,1978419655660313589124379
%N A375730 a(n) = n^n + n*n + n+n + 1.
%C A375730 The sum of "n OP n" for hyper-operators 0 to 3, where 0 = succession, 1 = addition, 2 = multiplication, 3 = exponentiation.
%F A375730 a(n) = n^n + (n+1)^2.
%F A375730 a(n) = A000312(n) + A000290(n) + A005843(n) + A000012(n).
%F A375730 E.g.f.: (1+3*x+x^2)*exp(x)+1/(1+LambertW(-x)). - _Alois P. Heinz_, Aug 26 2024
%e A375730 a(0) = (0^0)+(0*0)+(0+0)+1 = 1+0+0+1 = 2.
%e A375730 a(3) = (3^3)+(3*3)+(3+3)+1 = 27+9+6+1 = 43.
%t A375730 Join[{2},Table[n^n+(n+1)^2,{n,19}]] (* _James C. McMahon_, Sep 13 2024 *)
%o A375730 (Python)
%o A375730 def A375730(n): return n*(n*(n**(n-2)+1)+2)+1 if n>1 else 3*n+2 # _Chai Wah Wu_, Sep 02 2024
%Y A375730 Cf. A000012, A000290, A000312, A005843, A189896.
%K A375730 nonn,easy
%O A375730 0,1
%A A375730 _Anthony Veglia_, Aug 25 2024
%E A375730 a(19) corrected by _James C. McMahon_, Sep 13 2024