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 A350314 #7 Dec 25 2021 06:43:12
%S A350314 2,5,11,17,23,29,37,41,47,53,59,67,71,77,83,89,97,101,107,113,119,127,
%T A350314 131,137,143,149,157,161,167,173,179,187,191,197,203,209,221,227,233,
%U A350314 239,247,251,257,263,269,277,281,287,293,299,307,311,317,323,329,337
%N A350314 The catch-up points of the Redstone permutation A350313.
%C A350314 We say n is a 'catch-up point' of a permutation p of the positive integers if and only if p restricted to [n] = {1, 2, ..., n} is a permutation of [n].
%C A350314 The periodic structure of the first differences is described in A350315.
%t A350314 s = {2, 1}; c[_] = 0; Array[Set[c[s[[#]]], #] &, Length[s]]; j = Last[s]; u = 3; {2}~Join~Reap[Monitor[Do[If[j == u, While[c[u] > 0, u++]]; k = u; While[Nand[c[k] == 0, CoprimeQ[i, k], ! Divisible[i - 1, k]], k++]; If[k == u, Sow[i]]; Set[c[k], i]; j = k, {i, Length[s] + 1, 337}], i]][[-1, -1]] (* _Michael De Vlieger_, Dec 24 2021 *)
%Y A350314 Cf. A350313, A350315.
%K A350314 nonn
%O A350314 1,1
%A A350314 _Peter Luschny_, Dec 24 2021