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 A346455 #9 Jul 19 2021 18:29:44
%S A346455 1,52,55,56,57,58,77,88,93,94,95,96,99,100,119,124,147,148,161,162,
%T A346455 189,206,207,208,209,210,213,214,215,216,217,218,219,226,329,330,333,
%U A346455 334,335,394,395,416,417,424,425,428,489,514,515,544,545,546,549,554,579,584,723,724,725,800
%N A346455 a(n) is the smallest number k such that Sum_{j=1..k} (-1)^omega(j) = n, where omega(j) is the number of distinct primes dividing j.
%F A346455 a(n) = min {k : Sum_{j=1..k} mu(rad(j)) = n}, where mu is the Moebius function and rad is the squarefree kernel.
%t A346455 a[n_]:=(k=1;While[Sum[(-1)^PrimeNu@j,{j,k}]!=n,k++];k);Array[a,25] (* _Giorgos Kalogeropoulos_, Jul 19 2021 *)
%o A346455 (PARI) a(n) = my(k=1); while (sum(j=1, k, (-1)^omega(j)) !=n, k++); k; \\ _Michel Marcus_, Jul 19 2021
%Y A346455 Cf. A001221, A002053, A051400, A051401, A051402, A051470, A060434, A076479, A174863, A275547, A346456, A346457.
%K A346455 nonn
%O A346455 1,2
%A A346455 _Ilya Gutkovskiy_, Jul 19 2021