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 A277852 #13 Mar 28 2022 08:20:37
%S A277852 1,2,4,5,9,15,16,24,59,61,81,100,124,129,152,169,196,249,305,400,425,
%T A277852 475,520,556,565,676,771,795,904,939
%N A277852 "Late birds" (values a(n) < a(k) for all k > n) in A075771 = quotient + remainder of Euclidean division of n^2 by prime(n).
%C A277852 The lower bound A075771(n) >= n^2/prime(n) ensures that a given number can't occur beyond a certain index in that sequence.
%C A277852 See A277853 for the corresponding indices m.
%F A277852 a(n) = A075771(A277853(n)), i.e., equals A075771 o A277853.
%o A277852 (PARI) A277852(N,L=N^2/prime(N),A=A075771,S=List())={forstep(n=N,1,-1,A(n)<L&&listput(S,L=A(n)));Set(S)}
%Y A277852 Cf. A075771, A277851, A277853, A277854.
%K A277852 nonn,more
%O A277852 1,2
%A A277852 _M. F. Hasler_, Nov 25 2016