cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A116081 Final nonzero digit of n^n.

Original entry on oeis.org

1, 4, 7, 6, 5, 6, 3, 6, 9, 1, 1, 6, 3, 6, 5, 6, 7, 4, 9, 6, 1, 4, 7, 6, 5, 6, 3, 6, 9, 9, 1, 6, 3, 6, 5, 6, 7, 4, 9, 6, 1, 4, 7, 6, 5, 6, 3, 6, 9, 5, 1, 6, 3, 6, 5, 6, 7, 4, 9, 6, 1, 4, 7, 6, 5, 6, 3, 6, 9, 9, 1, 6, 3, 6, 5, 6, 7, 4, 9, 6, 1, 4, 7, 6, 5, 6, 3, 6, 9, 1, 1, 6, 3, 6, 5, 6, 7, 4, 9, 1, 1, 4, 7, 6, 5
Offset: 1

Views

Author

Greg Dresden, Mar 12 2006

Keywords

Comments

The decimal number .147656369116... formed from these digits is a transcendental number; see Dresden's second article. These digits are never eventually periodic.
Digits appear with predictable frequencies: 1/10 for 3, 4, and 7; 1/9 for 5; 3/25 for 9; 28/225 for 1; and 307/900 for 6. - Charles R Greathouse IV, Oct 03 2022

Examples

			a(4) = 6 because 4^4 (which is 256) ends in 6.
		

Crossrefs

Programs

  • Maple
    f:= proc(n) local d, m, p; d:= min(padic:-ordp(n,2), padic:-ordp(n,5));
       m:= n/10^d;
       p:= n - 1 mod 4 + 1;
       m &^ p mod 10;
    end proc:
    seq(f(n), n=1..1000); # Robert Israel, Oct 19 2014
  • Mathematica
    f[n_] := Block[{m = n}, While[ Mod[m, 10] == 0, m /= 10]; PowerMod[m, n, 10]]; Array[f, 105] (* Robert G. Wilson v, Mar 13 2006 and modified Oct 12 2014 *)
  • PARI
    f(n) = while(!(n % 10), n/=10); n % 10; \\ A065881
    a(n) = lift(Mod(f(n), 10)^n); \\ Michel Marcus, Sep 13 2022
    
  • PARI
    a(n)=my(k=n/10^valuation(n,10)); lift(Mod(k,10)^(n%4+4)) \\ Charles R Greathouse IV, Sep 13 2022
    
  • Python
    def a(n):
        k = n
        while k%10 == 0: k //= 10
        return pow(k, n, 10)
    print([a(n) for n in range(1, 106)]) # Michael S. Branicky, Sep 13 2022
    
  • Python
    def A116081(n): return pow(int(str(n).rstrip('0')[-1]),n,10) # Chai Wah Wu, Dec 07 2023

Formula

a(n) = A065881(n)^n mod 10 = A010879(A065881(n)^(A010883(n-1))). - Robert Israel, Oct 19 2014

Extensions

More terms from Robert G. Wilson v, Mar 13 2006