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.

A191485 Numbers n=k^2-k+1 such that 2^k == 1 (mod n).

Table of values

n a(n)
1 1
2 3
3 7
4 73
5 601
6 8191
7 262657
8 8640661

List of values

[1, 3, 7, 73, 601, 8191, 262657, 8640661]