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 A049478 #15 Aug 14 2021 15:12:37
%S A049478 0,1,4,6,12,22,27,62,64,84,104,106,108,114,132,142,178,179,186,213,
%T A049478 216,247,273,322,341,357,358,449,458,462,470,478,482,495,499,502,581,
%U A049478 585,597,598,623,662,672,681,735,772,778,794,818,827,851,864
%N A049478 Record values in A346778.
%C A049478 Record values of the least g >= 1 such that the first g terms of row n of A088643 [start with n and always append the largest k < n not yet used such that n+k is a prime] constitute the set {n, n-1, ..., n-g+1}, and the next (i.e., (g+1)-th) term of that row equals n-g. - _M. F. Hasler_, Aug 04 2021
%o A049478 (PARI) {print1(m=0); for( n=1, oo, my( r=A088643_row(n)); for( g=1, #r-1, if( Set(r[1..g]) == [n-g+1..n] && r[g+1]==n-g, g > m && print1(", "m=g); break)))} \\ _M. F. Hasler_, Aug 04 2021
%Y A049478 Cf. A049476, A049477, A088643, A346778.
%K A049478 nonn,nice
%O A049478 1,3
%A A049478 _N. J. A. Sloane_
%E A049478 Revised by _Sean A. Irvine_, Aug 03 2021