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 A370853 #22 Mar 16 2024 13:28:23
%S A370853 17,23,25,53,71,77,79,134,152,158,160,161,206,212,214,215,230,232,233,
%T A370853 238,239,241,296,314,320,322,350,386,398,402,404,422,428,430,440,452,
%U A370853 456,458,464,466,470,474,476,478,480,482,484,485,530,536,538,554,556
%N A370853 Numbers m such that c(0) < c(1) < c(2), where c(k) = number of k's in the ternary representation of m.
%H A370853 John Tyler Rascoe, <a href="/A370853/b370853.txt">Table of n, a(n) for n = 1..10000</a>
%e A370853 The ternary representation of 17 is 122, for which c(0)=0 < c(1)=1 < c(2)=2.
%t A370853 Select[Range[1000], DigitCount[#, 3, 0] < DigitCount[#, 3, 1] < DigitCount[#, 3, 2] &]
%o A370853 (PARI)
%o A370853 check(m) = {my(c0=0, c1=0, c2=0, s=Vec(digits(m, 3)));
%o A370853 for(i=1, length(s), if(s[i]==0, c0+=1, if(s[i]==1, c1+=1, if(s[i]==2, c2+=1,))));
%o A370853 c0<c1 && c1<c2;} \\ _John Tyler Rascoe_, Mar 11 2024
%Y A370853 Cf. A007089, A077267, A062756, A081603.
%Y A370853 Cf. A370854, A370855, A370856, A370859, A370863, A370870.
%K A370853 nonn,base
%O A370853 1,1
%A A370853 _Clark Kimberling_, Mar 03 2024