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 A355599 #4 Jul 16 2022 01:31:16
%S A355599 29,41,313,1499,941,12011,6287,52301,50077,137743,1274353,46303409,
%T A355599 89018221,687655393,7462816891
%N 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).
%C A355599 Is this overall an increasing sequence or does it enter a cycle?
%C A355599 The sequence decreases for the first time at n = 5.
%o A355599 (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 A355599 seq(29, 20) \\ Print initial 20 terms of sequence
%Y A355599 Row n = 10 of A249162.
%Y A355599 Cf. A355597, A355598, A355600, A355601, A355602.
%K A355599 nonn,hard,more
%O A355599 1,1
%A A355599 _Felix Fröhlich_, Jul 09 2022