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 A355597 #5 Jul 16 2022 01:30:50
%S A355597 2,5,7,19,127,911,7331,167149,387749,17153317,432383657,10459192927
%N 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).
%C A355597 Is this an increasing sequence or does it enter a cycle?
%o A355597 (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 A355597 seq(2, 20) \\ Print initial 20 terms of sequence
%Y A355597 Row n = 1 of A249162.
%Y A355597 Cf. A355598, A355599, A355600, A355601, A355602.
%K A355597 nonn,hard,more
%O A355597 1,1
%A A355597 _Felix Fröhlich_, Jul 09 2022