cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A083528 a(n) = 5^n mod 2*n.

Original entry on oeis.org

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

Views

Author

Labos Elemer, Apr 30 2003

Keywords

Comments

a(n) = 1 iff n is in A067946. - Robert Israel, Dec 26 2014

Examples

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

Crossrefs

Programs

  • Magma
    [Modexp(5, n, 2*n): n in [1..80]]; // Vincenzo Librandi, Oct 19 2018
  • Maple
    seq(5 &^n mod (2*n), n = 1 .. 100); # Robert Israel, Dec 26 2014
  • Mathematica
    Table[PowerMod[5, w, 2w], {w, 1, 100}]
  • PARI
    vector(100, n, lift(Mod(5, 2*n)^n)) \\ Michel Marcus, Dec 29 2014