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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Aug 08 2015 20:15:58
%S 0,1,2,3,4,5,6,7,8,9,0,1,4,9,6,5,6,9,4,1,0,1,8,7,4,5,6,3,2,9,0,1,6,1,
%T 6,5,6,1,6,1,0,1,2,3,4,5,6,7,8,9,0,1,4,9,6,5,6,9,4,1,0,1,8,7,4,5,6,3,
%U 2,9,0,1,6,1,6,5,6,1,6,1,0,1,2,3,4,5,6,7,8,9,0,1,4,9,6,5,6,9,4,1,0,1,8,7,4,5,6,3,2,9,0,1,6,1,6,5,6,1,6,1
%N Least significant digit of (n mod 10)^floor(n/10).
%C Periodic with a period of 40.
%F a(n) = +a(n-1) -a(n-2) +a(n-3) -a(n-4) +a(n-5) -a(n-6) +a(n-7) -a(n-8) +a(n-9) -a(n-10) +a(n-11) -a(n-12) +a(n-13) -a(n-14) +a(n-15) -a(n-16) +a(n-17) -a(n-18) +a(n-19) -a(n-20) +a(n-21) -a(n-22) +a(n-23) -a(n-24) +a(n-25) -a(n-26) +a(n-27) -a(n-28) +a(n-29) -a(n-30) +a(n-31) -a(n-32) +a(n-33) -a(n-34) +a(n-35) -a(n-36) +a(n-37) -a(n-38) +a(n-39). - _R. J. Mathar_, Oct 14 2010
%p A095187 := proc(n) ((n mod 10)^floor(n/10)) mod 10 ; end proc: seq(A095187(n),n=10..130) ; # _R. J. Mathar_, Oct 14 2010
%K base,nonn
%O 10,3
%A _Amarnath Murthy_, Jun 02 2004
%E Offset and entries corrected by _R. J. Mathar_, Oct 14 2010