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

%I #17 Jun 05 2016 02:03:14

%S 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,

%T 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,

%U 6,1,0,1,6,1,6,5,6,1,6,1,0,1,6,1,6

%N a(n) = n^n! (mod 10)

%C Periodic for n>3. Repeat: [6, 5, 6, 1, 6, 1, 0, 1, 6, 1]

%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,1).

%F 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

%t Table[PowerMod[n,n!,10],{n,0,84}]

%K nonn,easy

%O 0,3

%A _José María Grau Ribas_, Jan 21 2012

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 April 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)