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.

A273433 Smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^n).

Table of values

n a(n)
1 3
2 8
3 57
4 1047
5 27216
6 861642
7 21444846
8 674273372
9 147534349327
10 45941644105613
11 244158265828023
12 569209871196597077
13 15204969799577672558
14 2111244131216208612515
15 129192323492968413250921
16 25814874251189658671192458
17 13543096262710710570994132579

List of values

[3, 8, 57, 1047, 27216, 861642, 21444846, 674273372, 147534349327, 45941644105613, 244158265828023, 569209871196597077, 15204969799577672558, 2111244131216208612515, 129192323492968413250921, 25814874251189658671192458, 13543096262710710570994132579]