OFFSET
1,10
COMMENTS
a(n) = (6^(6^(6^(6^(6^ ... ))))) mod n, provided sufficient 6s are in the tower such that adding more doesn't affect the value of a(n).
LINKS
Wayne VanWeerthuizen, Table of n, a(n) for n = 1..10000
PROG
(Sage)
def tower6mod(n):
if ( n <= 12 ):
return 46656%n
else:
ep = euler_phi(n)
return power_mod(6, ep+tower6mod(ep), n)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wayne VanWeerthuizen, Aug 08 2014
STATUS
approved