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.

A262208 a(n) = prime(n)^prime(n) mod n^n.

Original entry on oeis.org

0, 3, 20, 247, 1861, 28669, 202564, 12127115, 115222124, 6126483469, 19465244918, 4282552771669, 4226847828547, 3334905643119667, 311202902635062863, 13506468355090939237, 455126377640041434982, 3558300899222541879853
Offset: 1

Views

Author

Altug Alkan, Sep 15 2015

Keywords

Comments

Inspired by A262207.

Examples

			For n = 2, a(n) = 27 mod 4 = 3.
		

Crossrefs

Programs

  • Magma
    [NthPrime(n)^NthPrime(n) mod n^n: n in [1..20]]; // Vincenzo Librandi, Sep 16 2015
  • Mathematica
    Table[Mod[Prime[n]^Prime[n], n^n], {n, 18}] (* Michael De Vlieger, Sep 15 2015 *)
  • PARI
    a(n) = (prime(n)^prime(n)) % (n^n);
    vector(20, n, a(n))
    

Formula

a(n) = A051674(n) mod A000312(n).