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.

A355598 a(1) = 3. 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 3
2 17
3 131
4 659
5 503
6 9833
7 49603
8 327317
9 13900147
10 144229223
11 5872276013

List of values

[3, 17, 131, 659, 503, 9833, 49603, 327317, 13900147, 144229223, 5872276013]