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 A176824 #34 May 23 2023 14:57:50
%S A176824 0,1,10,113,1526,24337,450066,9492289,225159022,5937424601,
%T A176824 172385029466,5465884225969,187964560069638,6968912374274593,
%U A176824 277133723845128226,11767703728247765249,531431035966023003614,25434534147318166381993,1286040688679372821752042
%N A176824 a(n) = (n+1)^n mod n^n.
%H A176824 G. C. Greubel, <a href="/A176824/b176824.txt">Table of n, a(n) for n = 1..380</a>
%F A176824 From _Peter Bala_, Sep 12 2012: (Start)
%F A176824 a(n) = (n+1)^n - 2*n^n (since 2*n^n <= (n+1)^n < 3*n^n for n >= 1).
%F A176824 In terms of the tree function T(x) = Sum_{n >= 1} n^(n-1)*x^n/n! of A000169 the e.g.f. is T(x)*(2*x + T(x)*(T(x)-2))/(x^2*(T(x)-1)^3) = x + 10*x^2/2! + 113*x^3/3! + ... . (End)
%F A176824 a(n) = Sum_{i=1..n-1} C(n,i-1)*i^(i-1)*(n-i)^(n-i). - _Vladimir Kruchinin_, Sep 07 2015
%F A176824 a(n) = A000169(n+1) - 2*A000312(n). - _Michel Marcus_, Sep 07 2015, after _Peter Bala_
%p A176824 A176824:=n->(n+1)^n mod n^n: seq(A176824(n), n=1..25); # _Wesley Ivan Hurt_, Sep 10 2015
%t A176824 Table[Mod[(n+1)^n, n^n], {n,30}]
%o A176824 (Magma) [(n+1)^n mod n^n: n in [1..20]]; // _Vincenzo Librandi_, Sep 07 2015
%o A176824 (PARI) first(m)=vector(m,i,((i+1)^i) % (i^i)) \\ _Anders Hellström_, Sep 07 2015
%o A176824 (SageMath) [(n+1)^n%n^n for n in range(1,31)] # _G. C. Greubel_, May 23 2023
%Y A176824 Cf. A000169, A000312, A048160.
%K A176824 nonn,easy
%O A176824 1,3
%A A176824 _Vladimir Joseph Stephan Orlovsky_, Apr 26 2010
%E A176824 a(19) from _Vincenzo Librandi_, Sep 07 2015