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.

A066611 a(1) = 1; a(n) = n^n mod (n-1)^(n-1) for n > 1.

Original entry on oeis.org

1, 0, 3, 13, 53, 2906, 30391, 306356, 1544521, 314487775, 5311670611, 71438659315, 8643791799805, 208502988236908, 4525624184096751, 55200677713457866, 15583522643116493073, 466115766638709659105, 11099251895486710352779, 1358250003379776429113, 75419018385982521381124421
Offset: 1

Views

Author

Amarnath Murthy, Dec 24 2001

Keywords

Examples

			a(5) = 53 as 5^5 = 3125 = (4^4)*12 + 53.
		

Programs

  • Mathematica
    Table[ Mod[ n^n, (n - 1)^(n - 1)], {n, 2, 20} ]
    Join[{1},Table[PowerMod[n,n,(n-1)^(n-1)],{n,2,20}]] (* Harvey P. Dale, Dec 14 2017 *)
  • PARI
    a(n) = { n^n % (n-1)^(n-1) } \\ Harry J. Smith, Mar 12 2010

Extensions

More terms from Robert G. Wilson v, Dec 26 2001