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.

A179395 a(n) = prime(n)^2 mod prime(n+3).

Original entry on oeis.org

4, 9, 12, 15, 7, 8, 28, 20, 11, 21, 15, 6, 38, 20, 13, 62, 2, 71, 65, 61, 78, 33, 21, 93, 100, 64, 100, 19, 91, 28, 5, 26, 45, 10, 33, 89, 83, 77, 15, 133, 3, 59, 64, 113, 7, 103, 95, 100, 144, 144, 73, 67, 221, 55, 196, 196, 144, 144, 256, 62, 162, 87, 100, 69, 239, 206, 324, 256, 144, 324, 27, 21, 256, 256, 324
Offset: 1

Views

Author

Umut Uludag, Jan 07 2011

Keywords

Examples

			a(1) = 2^2 mod  7 =  4 mod  7 =  4;
a(2) = 3^2 mod 11 =  9 mod 11 =  9;
a(3) = 5^2 mod 13 = 25 mod 13 = 12;
a(4) = 7^2 mod 17 = 49 mod 17 = 15.
		

Crossrefs

Cf. A167770.

Programs

  • Maple
    A179395 := proc(n) ithprime(n)^2 mod ithprime(n+3); end proc: # R. J. Mathar, Jan 09 2011
  • Mathematica
    Table[Mod[Prime[n]^2,Prime[n+3]],{n,100}]  (* Harvey P. Dale, Jan 21 2011 *)