The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A365935 Final digit (in decimal system) of n^(n+1) = A007778(n). 2
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, 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, 8, 1, 0, 1, 2, 9, 4, 5, 6, 9, 2, 1, 0, 1, 8, 1, 4, 5, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
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).
LINKS
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1).
FORMULA
a(n) = n^(n+1) mod 10.
a(n) = A010879(A007778(n)).
a(n) = A365936(n+10).
EXAMPLE
For n = 3, a(3) = 3^4 mod 10 = 81 mod 10 = 1.
MATHEMATICA
a[n_]:=Last[IntegerDigits[n^(n+1)]]; Array[a, 87, 0] (* Stefano Spezia, Sep 26 2023 *)
PROG
(PARI) a(n) = lift(Mod(n, 10)^(n+1)); \\ Michel Marcus, Sep 23 2023
CROSSREFS
Sequence in context: A019981 A194281 A117038 * A172168 A371874 A321095
KEYWORD
nonn,base,easy
AUTHOR
Marco Ripà, Sep 23 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 08:10 EDT 2024. Contains 372579 sequences. (Running on oeis4.)