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.
%I A355602 #4 Jul 16 2022 01:32:28
%S A355602 61,601,2269,13499,58313,1950827,57480139,713589493,4722480517
%N 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).
%C A355602 Is this overall an increasing sequence or does it enter a cycle?
%o A355602 (PARI) seq(start, terms) = my(x=start, i=1); print1(start, ", "); while(1, forprime(q=1, , if(Mod(q, x^2)^(x-1)==1, print1(q, ", "); x=q; i++; if(i >= terms, break({2}), break))))
%o A355602 seq(61, 20) \\ Print initial 20 terms of sequence
%Y A355602 Row n = 18 of A249162.
%Y A355602 Cf. A355597, A355598, A355599, A355600, A355601.
%K A355602 nonn,hard,more
%O A355602 1,1
%A A355602 _Felix Fröhlich_, Jul 09 2022