|
|
A260031
|
|
Final nonzero digit of n^n in base 12.
|
|
1
|
|
|
1, 4, 3, 4, 5, 3, 7, 4, 9, 4, 11, 1, 1, 4, 3, 4, 5, 3, 7, 4, 9, 4, 11, 4, 1, 4, 3, 4, 5, 3, 7, 4, 9, 4, 11, 9, 1, 4, 3, 4, 5, 3, 7, 4, 9, 4, 11, 4, 1, 4, 3, 4, 5, 3, 7, 4, 9, 4, 11, 1, 1, 4, 3, 4, 5, 3, 7, 4, 9, 4, 11, 9, 1, 4, 3, 4, 5, 3, 7, 4, 9, 4, 11, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
PROG
|
(Python)
from gmpy2 import mpz, digits
s = digits(mpz(n)**mpz(n), 12)
t = s[-1]
while t == '0':
s = s[:-1]
t = s[-1]
(Haskell)
import Math.NumberTheory.Moduli (powerMod)
a260031 n = if x > 0 then x else f $ div (n ^ n) 12
where x = powerMod n n 12
f z = if m == 0 then f z' else m
where (z', m) = divMod z 12
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|