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 A364805 #13 Aug 14 2023 15:00:02
%S A364805 1,1,1,1,1,1,141,141,211,211,82321,82321,526093,526093,526093,526093,
%T A364805 127890361,127890361
%N A364805 a(n) is the smallest number k such that the number of distinct prime divisors of the n numbers from k through k+n-1 are in nondescending order.
%C A364805 Smallest initial number k of n consecutive numbers satisfying omega(k) <= omega(k+1) <= ... <= omega(k+n-1).
%e A364805 a(9) = 211 = a(10) as omega(211) = 1 < omega(212) = omega(213) = omega(214) = omega(215) = omega(216) = omega(217) = omega(218) = omega(219) = 2 < omega(220) = 3.
%t A364805 k = 1; Do[While[t = Table[PrimeNu[i], {i, k, k + n - 1}]; t != Sort[t], k++]; Print[k], {n, 1, 16}]
%o A364805 (PARI) a(n) = my(k=1, list=List(vector(n, i, omega(i)))); while (vecsort(list) != list, listpop(list, 1); k++; listput(list, omega(k+n-1))); k; \\ _Michel Marcus_, Aug 14 2023
%Y A364805 Cf. A001221, A075046, A286287, A364804.
%K A364805 nonn,more
%O A364805 1,7
%A A364805 _Ilya Gutkovskiy_, Aug 08 2023
%E A364805 a(17)-a(18) from _Michel Marcus_, Aug 14 2023