Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
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
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: A363939 A094090 A200632 * A008959 A316347 A169917
KEYWORD
nonn,easy
AUTHOR
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 August 17 04:30 EDT 2024. Contains 375198 sequences. (Running on oeis4.)