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 A365935 #26 Oct 19 2023 23:08:04 %S A365935 0,1,8,1,4,5,6,1,8,1,0,1,2,9,4,5,6,9,2,1,0,1,8,1,4,5,6,1,8,1,0,1,2,9, %T A365935 4,5,6,9,2,1,0,1,8,1,4,5,6,1,8,1,0,1,2,9,4,5,6,9,2,1,0,1,8,1,4,5,6,1, %U A365935 8,1,0,1,2,9,4,5,6,9,2,1,0,1,8,1,4,5,6 %N A365935 Final digit (in decimal system) of n^(n+1) = A007778(n). %C A365935 This is a periodic sequence (1, 8, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 9, 4, 5, 6, 9, 2, 1, 0) with period 20 (which is twice the base). %H A365935 <a href="/index/Rec#order_20">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1). %F A365935 a(n) = n^(n+1) mod 10. %F A365935 a(n) = A010879(A007778(n)). %F A365935 a(n) = A365936(n+10). %e A365935 For n = 3, a(3) = 3^4 mod 10 = 81 mod 10 = 1. %t A365935 a[n_]:=Last[IntegerDigits[n^(n+1)]]; Array[a,87,0] (* _Stefano Spezia_, Sep 26 2023 *) %o A365935 (PARI) a(n) = lift(Mod(n, 10)^(n+1)); \\ _Michel Marcus_, Sep 23 2023 %Y A365935 Cf. A007778, A010879, A056849, A120962, A365707. %K A365935 nonn,base,easy %O A365935 0,3 %A A365935 _Marco Ripà_, Sep 23 2023