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.

A355597 a(1) = 2. For n > 1, a(n) = smallest prime q such that q^(a(n-1)-1) == 1 (mod a(n-1)^2).

Table of values

n a(n)
1 2
2 5
3 7
4 19
5 127
6 911
7 7331
8 167149
9 387749
10 17153317
11 432383657
12 10459192927

List of values

[2, 5, 7, 19, 127, 911, 7331, 167149, 387749, 17153317, 432383657, 10459192927]