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.

A355602 a(1) = 61. 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 61
2 601
3 2269
4 13499
5 58313
6 1950827
7 57480139
8 713589493
9 4722480517

List of values

[61, 601, 2269, 13499, 58313, 1950827, 57480139, 713589493, 4722480517]