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.

A014117 Numbers n such that m^(n+1) == m (mod n) holds for all m.

Table of values

n a(n)
1 1
2 2
3 6
4 42
5 1806

List of values

[1, 2, 6, 42, 1806]