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.

A166865 Triangle read by rows: R(n,k)=prime(k)^(prime(n)-2) mod n, 1<=k<=n.

Original entry on oeis.org

0, 0, 1, 2, 0, 2, 0, 3, 1, 3, 2, 3, 0, 2, 1, 2, 3, 5, 1, 5, 1, 1, 6, 6, 0, 1, 6, 6, 0, 3, 5, 7, 3, 5, 1, 3, 8, 0, 8, 1, 8, 1, 8, 1, 8, 8, 7, 5, 3, 1, 7, 3, 9, 7, 9, 6, 4, 9, 8, 0, 6, 2, 7, 1, 8, 5, 8, 3, 5, 7, 11, 1, 5, 7, 11, 5, 7, 1
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 16 2010

Keywords

Comments

Row sums: 0, 1, 4, 7, 8, 17, 26, 27, 43, 59, 56, 71, …, .

Examples

			Triangle begins:
0,
0, 1,
2, 0, 2,
0, 3, 1, 3,
2, 3, 0, 2, 1,
2, 3, 5, 1, 5, 1,
		

Crossrefs

Programs

  • Mathematica
    t[n_, k_] := Mod[Prime@ k^(Prime@ n - 2), n]; Table[ t[n, k], {n, 12}, {k, n}] // Flatten