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.

A083530 a(n) = 7^n mod (2*n).

Original entry on oeis.org

1, 1, 1, 1, 7, 1, 7, 1, 1, 9, 7, 1, 7, 21, 13, 1, 7, 1, 7, 1, 7, 5, 7, 1, 7, 49, 1, 49, 7, 49, 7, 1, 13, 49, 63, 1, 7, 49, 31, 1, 7, 49, 7, 25, 37, 49, 7, 1, 49, 49, 37, 9, 7, 1, 43, 49, 1, 49, 7, 1, 7, 49, 91, 1, 37, 37, 7, 89, 67, 49, 7, 1, 7, 49, 43, 121, 105, 25, 7, 1, 1, 49, 7, 49, 147, 49
Offset: 1

Views

Author

Labos Elemer, Apr 30 2003

Keywords

Examples

			For n = 5, a(5) = 7 because 7^5 = 16807 = 1680*10 + 7, that is 7^5 == 7 (mod 2*5).
		

Crossrefs

Programs

  • Mathematica
    Table[Mod[7^w, 2*w], {w, 1, 100}]
  • PARI
    a(n)=lift(Mod(7,2*n)^n) \\ Charles R Greathouse IV, Oct 03 2016