login

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

A062176
a(n) = 5^(n-1) mod n.
2
0, 1, 1, 1, 0, 5, 1, 5, 7, 5, 1, 5, 1, 5, 10, 13, 1, 11, 1, 5, 4, 5, 1, 5, 0, 5, 16, 13, 1, 5, 1, 13, 25, 5, 30, 29, 1, 5, 25, 5, 1, 17, 1, 37, 25, 5, 1, 29, 43, 25, 25, 21, 1, 11, 20, 5, 25, 5, 1, 5, 1, 5, 25, 13, 40, 23, 1, 57, 25, 55, 1, 29, 1, 5, 25, 49, 16, 5, 1, 45, 16, 5, 1, 17, 30, 5
OFFSET
1,6
PROG
(PARI) { for (n=1, 1000, write("b062176.txt", n, " ", 5^(n - 1)%n) ) } \\ Harry J. Smith, Aug 02 2009
CROSSREFS
Cf. A062172.
Sequence in context: A081774 A103193 A011093 * A338167 A372958 A129769
KEYWORD
nonn
AUTHOR
Henry Bottomley, Jun 12 2001
STATUS
approved