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

A083528
a(n) = 5^n mod 2*n.
6
1, 1, 5, 1, 5, 1, 5, 1, 17, 5, 5, 1, 5, 25, 5, 1, 5, 1, 5, 25, 41, 25, 5, 1, 25, 25, 53, 9, 5, 25, 5, 1, 59, 25, 45, 1, 5, 25, 47, 65, 5, 1, 5, 9, 35, 25, 5, 1, 19, 25, 23, 1, 5, 1, 45, 81, 11, 25, 5, 25, 5, 25, 125, 1, 5, 49, 5, 81, 125, 65, 5, 1, 5, 25, 125, 17, 3, 25, 5, 65, 161, 25, 5, 1, 65
OFFSET
1,3
COMMENTS
a(n) = 1 iff n is in A067946. - Robert Israel, Dec 26 2014
LINKS
EXAMPLE
a(3) = 5 because 5^3 = 125 and 125 == 5 mod (2 * 3).
a(4) = 1 because 5^4 = 625 and 625 == 1 mod (2 * 4).
MAPLE
seq(5 &^n mod (2*n), n = 1 .. 100); # Robert Israel, Dec 26 2014
MATHEMATICA
Table[PowerMod[5, w, 2w], {w, 1, 100}]
PROG
(PARI) vector(100, n, lift(Mod(5, 2*n)^n)) \\ Michel Marcus, Dec 29 2014
(Magma) [Modexp(5, n, 2*n): n in [1..80]]; // Vincenzo Librandi, Oct 19 2018
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Apr 30 2003
STATUS
approved