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.

A355599 a(1) = 29. 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 29
2 41
3 313
4 1499
5 941
6 12011
7 6287
8 52301
9 50077
10 137743
11 1274353
12 46303409
13 89018221
14 687655393
15 7462816891

List of values

[29, 41, 313, 1499, 941, 12011, 6287, 52301, 50077, 137743, 1274353, 46303409, 89018221, 687655393, 7462816891]