This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS a(n) = 1 iff n is in A067946. - Robert Israel, Dec 26 2014 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 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 (MAGMA) [5^n mod(2*n): n in [1..100]]; // Vincenzo Librandi, Jul 31 2011 (PARI) vector(100, n, lift(Mod(5, 2*n)^n)) \\ Michel Marcus, Dec 29 2014 CROSSREFS Cf. A000079, A000244, A000351, A000420, A082511. Cf. A067946, A083529, A083530. Sequence in context: A176260 A098190 A050349 * A056957 A224834 A095118 Adjacent sequences:  A083525 A083526 A083527 * A083529 A083530 A083531 KEYWORD easy,nonn AUTHOR Labos Elemer, Apr 30 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .