A175435 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A175435

(Digit sum of 3^n) mod n.

0, 1, 0, 1, 4, 0, 4, 2, 0, 7, 5, 6, 1, 3, 6, 11, 10, 9, 17, 5, 6, 1, 8, 6, 13, 11, 0, 16, 14, 3, 19, 31, 6, 31, 11, 9, 16, 14, 3, 10, 17, 6, 22, 2, 9, 16, 32, 21, 10, 44, 15, 13, 29, 0, 35, 34, 51, 10, 58, 39, 13, 29, 27, 16, 5, 51, 28, 17, 15, 4, 38, 18, 7

(list; graph; refs; listen; history; text; internal format)

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