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 A323083 #20 Oct 11 2021 18:44:04
%S A323083 0,1,12,21,22422,24223,33333,34441524,4242436235,23443535352,
%T A323083 34462443242,35256523324,4341535435353,4645441523344,5244526446515,
%U A323083 5335524234335
%N A323083 k-digit numbers whose digit(s) are the number of distinct prime factors in each of the following k integers.
%C A323083 a(9) = 4242436235 found by _Carlos Rivera_.
%C A323083 a(17) > 10^13. - _Giovanni Resta_, Jan 04 2019
%H A323083 Chris Caldwell and G. L. Honaker, Jr, <a href="https://primes.utm.edu/curios/page.php?short=24223">Prime Curio for 24223</a>
%e A323083 21 is a term because 21 is a 2-digit number and its digits (2,1) are the number of distinct prime factors in each of the following 2 integers; i.e., 22 = 2*11 (two distinct prime factors) and 23 = 23 (one distinct prime factor), therefore (2,1) -> 21.
%o A323083 (PARI) isok(m) = {my(d=digits(m)); for (i=1, #d, if (d[i] != omega(m+i), return(0));); return (1);} \\ _Michel Marcus_, Oct 11 2021
%Y A323083 Cf. A000040, A001221, A323084.
%K A323083 nonn,base,more
%O A323083 1,3
%A A323083 _G. L. Honaker, Jr._, Jan 03 2019
%E A323083 a(10)-a(16) from _Giovanni Resta_, Jan 04 2019