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.

A066606 a(n) = 2^n mod n^2.

Original entry on oeis.org

0, 0, 8, 0, 7, 28, 30, 0, 26, 24, 112, 64, 80, 116, 143, 0, 155, 28, 116, 176, 197, 444, 255, 64, 57, 316, 80, 128, 60, 424, 374, 0, 602, 616, 18, 784, 76, 460, 944, 576, 207, 1324, 303, 1600, 782, 1016, 1929, 1792, 2382, 124, 1844, 2512, 1009, 568, 1693, 704
Offset: 1

Views

Author

Amarnath Murthy, Dec 22 2001

Keywords

Examples

			a(7) = 30 as 2^7 = 128 = (7^2)*2 + 30.
		

Programs

  • Maple
    a:= n-> 2&^n mod (n^2):
    seq(a(n), n=1..100);  # Alois P. Heinz, Jul 04 2017
  • Mathematica
    Table[PowerMod[2,n,n^2],{n,60}] (* Harvey P. Dale, Dec 08 2015 *)
  • PARI
    a(n) = { lift(Mod(2, n^2)^n) } \\ Harry J. Smith, Mar 10 2010

Extensions

More terms from Floor van Lamoen and Robert G. Wilson v, Dec 23 2001