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 A348266 #57 Oct 06 2024 12:44:01
%S A348266 22,313,2232,2323,2333,32215,432152,2434332,4222423,43332543,
%T A348266 332325334,2535332433,4532543535234,5435433351423
%N A348266 k-digit numbers whose digit(s) are the number of distinct prime factors in each of the preceding k integers.
%C A348266 a(12) <= 2535332433. - _David A. Corneth_, Oct 10 2021
%C A348266 a(12) >= 10^9. - _Michel Marcus_, Oct 11 2021
%e A348266 22 is a term because omega(20) = 2 and omega(21) = 2, whose concatenation is 22.
%e A348266 313 is a term because preceding it omega(310) = 3, omega(311) = 1 and omega(312) = 3, and their concatenation is 313.
%e A348266 32215 is a term because, the number of distinct prime divisors of 32210, 32211, 32212, 32213 and 32214 are 3, 2, 2, 1, 5 and their ordered concatenation gives the next number 32215.
%t A348266 Select[Range[33000], FromDigits[PrimeNu /@ (# - Range[IntegerLength[#], 1, -1])] == # &] (* _Amiram Eldar_, Oct 09 2021 *)
%o A348266 (PARI) isok(m) = {my(s="", k=m, i=1); while(1, s = concat(s, Str(omega(k))); if (eval(s) == m+i, return (i)); if (eval(s) > m+i, return(0)); k++; i++;);}
%o A348266 lista(nn) = my(nb); for(n=1, nn, if (nb=isok(n), print1(n+nb, ", "))); \\ _Michel Marcus_, Oct 09 2021
%Y A348266 Cf. A001221, A000961, A007774, A033992, A033993, A051270, A074969, A176655.
%Y A348266 Cf. A323083.
%K A348266 nonn,base,more
%O A348266 1,1
%A A348266 _Metin Sariyar_, Oct 09 2021
%E A348266 a(8)-a(9) from _Amiram Eldar_, Oct 09 2021
%E A348266 a(10)-a(11) from _Michel Marcus_, Oct 10 2021
%E A348266 a(12) confirmed by _Martin Ehrenstein_, Oct 28 2021
%E A348266 a(13)-a(14) from _Martin Ehrenstein_, Oct 30 2021