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 A338628 #20 Jul 19 2023 08:55:57
%S A338628 1,1,1,844,3624,22020,671346,8870024,264459172,463239475,1407472722,
%T A338628 108494875170,12385053656370,145065154350545
%N A338628 a(n) is the smallest number k such that n consecutive integers starting at k have the same number of square divisors (A046951).
%H A338628 <a href="/index/Di#divisors">Index entries for sequences related to divisors of numbers</a>
%e A338628 844 has 2 square divisors {1, 4}, 845 has 2 square divisors {1, 169}, 846 has 2 square divisors {1, 9} and 847 has 2 square divisors {1, 121}. These are the first 4 consecutive numbers with the same number of square divisors, so a(4) = 844.
%t A338628 Do[find = 0; k = 0; While[find == 0, k++; If[Length[Union[Table[Length[Select[Divisors[j], IntegerQ[Sqrt[#]] &]], {j, k, k + n - 1}]]] == 1, find = 1; Print[k]]], {n, 1, 7}]
%o A338628 (PARI) isok(n, k) = #Set(apply(x->sumdiv(x, d, issquare(d)), vector(n, i, k+i-1))) == 1;
%o A338628 a(n) = my(k=1); while(! isok(n, k), k++); k; \\ _Michel Marcus_, Nov 05 2020
%Y A338628 Cf. A006558, A045983, A045984, A046951, A324593, A324594.
%K A338628 nonn,more
%O A338628 1,4
%A A338628 _Ilya Gutkovskiy_, Nov 04 2020
%E A338628 a(8)-a(11) from _Amiram Eldar_, Nov 04 2020
%E A338628 a(12)-a(14) from _Martin Ehrenstein_, Jul 19 2023