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.

A179398 a(n) = prime(n)^2 mod prime(n-3).

Original entry on oeis.org

1, 1, 4, 2, 9, 9, 8, 11, 12, 28, 20, 26, 21, 41, 8, 37, 26, 22, 10, 2, 37, 8, 75, 18, 3, 64, 100, 79, 48, 11, 17, 62, 59, 46, 47, 105, 99, 93, 29, 151, 17, 75, 64, 131, 85, 187, 113, 100, 144, 144, 91, 85, 2, 73, 196, 196, 144, 144, 256, 114, 218, 107, 100, 89, 263, 266, 324, 256, 144, 324, 47, 41, 256, 256, 324
Offset: 4

Views

Author

Umut Uludag, Jan 07 2011

Keywords

Examples

			a(1) =  7^2 mod 2 =  49 mod 2 = 1;
a(2) = 11^2 mod 3 = 121 mod 3 = 1;
a(3) = 13^2 mod 5 = 169 mod 5 = 4;
a(4) = 17^2 mod 7 = 289 mod 7 = 2.
		

Crossrefs

Cf. A038702.

Programs

  • Maple
    A179398 := proc(n) ithprime(n)^2 mod ithprime(n-3); end proc: # R. J. Mathar, Jan 09 2011
  • Mathematica
    Table[PowerMod[Prime[n],2,Prime[n-3]],{n,4,80}] (* Harvey P. Dale, Dec 13 2011 *)