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 A351624 #22 May 05 2022 12:46:07
%S A351624 1,91,93,117,147,164,172,189,224,231,254,273,284,327,344,357,374,382,
%T A351624 399,411,434,464,483,494,543,561,567,584,592,609,644,674,693,704,747,
%U A351624 777,794,819,854,884,891,903,914,932,939,957,987,1001,1012,1029,1064,1094
%N A351624 Fixed points of A093714.
%C A351624 From _Michael De Vlieger_, May 04 2022: (Start)
%C A351624 Also positions of 0's in A352931.
%C A351624 Fixed points of A352588 are these terms together with 2 and 8. (End)
%H A351624 Rémy Sigrist, <a href="/A351624/b351624.txt">Table of n, a(n) for n = 1..10000</a>
%H A351624 Rémy Sigrist, <a href="/A351624/a351624.png">Logarithmic scatterplot of the first differences of the first 400000 terms</a>
%H A351624 Rémy Sigrist, <a href="/A351624/a351624.txt">C program</a>
%e A351624 A093714(91) = 91 so 91 belongs to this sequence.
%e A351624 A093714(92) = 88 so neither 88 nor 92 belongs to this sequence.
%t A351624 {1}~Join~Reap[Do[k = u; While[Nand[FreeQ[c, k], CoprimeQ[j, k], k != j + 1], k++]; j = k; AppendTo[c, k]; If[k == i, Sow[k]]; If[k == u, While[MemberQ[c, u], u++]; c = DeleteCases[c, _?(# < u &)]], {i, 2, nn}]][[-1, -1]] (* _Michael De Vlieger_, May 04 2022 *)
%o A351624 (C) See Links section.
%Y A351624 Cf. A093714, A352588, A352931.
%K A351624 nonn
%O A351624 1,2
%A A351624 _Rémy Sigrist_, May 04 2022