login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056849 Final digit of n^n. 15
1, 4, 7, 6, 5, 6, 3, 6, 9, 0, 1, 6, 3, 6, 5, 6, 7, 4, 9, 0, 1, 4, 7, 6, 5, 6, 3, 6, 9, 0, 1, 6, 3, 6, 5, 6, 7, 4, 9, 0, 1, 4, 7, 6, 5, 6, 3, 6, 9, 0, 1, 6, 3, 6, 5, 6, 7, 4, 9, 0, 1, 4, 7, 6, 5, 6, 3, 6, 9, 0, 1, 6, 3, 6, 5, 6, 7, 4, 9, 0, 1, 4, 7, 6, 5, 6, 3, 6, 9, 0, 1, 6, 3, 6, 5, 6, 7, 4, 9, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Cyclic with a period of 20.
Also decimal expansion of 147656369016365674900/(10^20-1). - Bruno Berselli, Sep 27 2021
REFERENCES
R. Euler and J. Sadek, "A Number That Gives The Units Of n^n", Journal of Recreational Mathematics, vol. 29(3), 1998, pp. 203-4.
LINKS
Hung Viet Chu, New Transcendental Numbers from Certain Sequences, arXiv:1908.03855 [math.NT], 2019. Mentions this sequence.
Gregory P. Dresden, Three transcendental numbers from the last non-zero digits of n^n, F_n and n!, Mathematics Magazine, vol. 81, 2008, pp. 96-105.
Gregory Dresden, Two Irrational Numbers That Give the Last Non-Zero Digits of n! and n^n, arXiv:1904.10274 [math.NT], 2019.
Jose María Grau and A. M. Oller-Marcen, On the last digit and the last non-zero digit of n^n in base b, arXiv:1203.4066 [math.NT], 2012.
Jose María Grau and A. M. Oller-Marcen, On the last digit and the last non-zero digit of n^n in base b, Bull. Korean Math. Soc. 51 (2014), No. 5, pp. 1325-1337.
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).
MAPLE
seq(n &^ n mod 10, n=1..120);
MATHEMATICA
Table[PowerMod[n, n, 10], {n, 1, 100}]
PROG
(Magma) [Modexp(n, n, 10): n in [1..100]]; // Bruno Berselli, Sep 27 2021
(PARI) a(n)=lift(Mod(n, 10)^n) \\ Charles R Greathouse IV, Dec 29 2012
(Python)
def a(n): return pow(n, n, 10)
print([a(n) for n in range(1, 101)]) # Michael S. Branicky, Sep 13 2022
CROSSREFS
Sequence in context: A351547 A354828 A308366 * A116081 A361351 A275162
KEYWORD
nonn,base,easy
AUTHOR
Robert G. Wilson v, Aug 30 2000
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 December 1 21:17 EST 2023. Contains 367502 sequences. (Running on oeis4.)