OFFSET
1,5
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..5000
EXAMPLE
a(5) = 4 because digsum(3^5) mod 5 = digsum(243) mod 5 = 9 mod 5 = 4.
MAPLE
read(transforms): A175435 := proc(n) return digsum(3^n) mod n: end proc: seq(A175435(n), n=1..50); # Nathaniel Johnston, Oct 09 2013
PROG
(PARI) a(n) = sumdigits(3^n) % n; \\ Michel Marcus, Oct 09 2013
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Dec 03 2010
STATUS
approved