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.

A175932 Smallest prime p such that there exist exactly n integers b such that 1 < b < p and b^(p-1) == 1 (mod p^2) or, equivalently, Fermat quotient q_p(b) == 0 (mod p).

Table of values

n a(n)
0 2
1 29
2 11
3 269
4 487
5 653
6 5107
7 103291
8 40487
9 2544079
10 1093
11 3511
12 1006003

List of values

[2, 29, 11, 269, 487, 653, 5107, 103291, 40487, 2544079, 1093, 3511, 1006003]