The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A186723 a(n) = n^n! (mod 10) 0
 0, 1, 4, 9, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6, 5, 6, 1, 6, 1, 0, 1, 6, 1, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Periodic for n>3. Repeat: [6, 5, 6, 1, 6, 1, 0, 1, 6, 1] LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,1). FORMULA G.f.: x*(8*x^12 - 2*x^11 - x^8 - 6*x^7 - x^6 - 6*x^5 - 5*x^4 - 6*x^3 - 9*x^2 - 4*x - 1)/(x^10 - 1). - Chai Wah Wu, Jun 04 2016 MATHEMATICA Table[PowerMod[n, n!, 10], {n, 0, 84}] CROSSREFS Sequence in context: A201415 A094090 A200632 * A008959 A316347 A169917 Adjacent sequences:  A186720 A186721 A186722 * A186724 A186725 A186726 KEYWORD nonn,easy AUTHOR José María Grau Ribas, Jan 21 2012 STATUS approved

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

Last modified January 21 16:54 EST 2020. Contains 331114 sequences. (Running on oeis4.)