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.

A267488 Smallest b > 1 such that there exists an odd prime p with p < b such that b^(p-1) == 1 (mod p^n).

Table of values

n a(n)
1 4
2 7
3 18
4 80
5 242
6 728
7 2186
8 6560
9 19682
10 59048
11 177146
12 531440
13 1594322

List of values

[4, 7, 18, 80, 242, 728, 2186, 6560, 19682, 59048, 177146, 531440, 1594322]