login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Numbers m such that c(0) <= c(1) <= c(2), where c(k) = number of k's in the ternary representation of m.
3

%I #9 Mar 09 2024 11:20:59

%S 2,5,7,8,11,15,17,19,21,23,25,26,35,44,47,50,51,52,53,59,61,65,68,69,

%T 70,71,73,75,76,77,79,80,98,104,106,107,116,128,132,134,140,142,143,

%U 146,150,152,154,155,156,158,159,160,161,176,178,179,184,185,187

%N Numbers m such that c(0) <= c(1) <= c(2), where c(k) = number of k's in the ternary representation of m.

%e The ternary representation of 15 is 120, for which c(0)=1 <= c(1)=1 < c(2)=1. So 15 is in the sequence.

%t Select[Range[1000], DigitCount[#, 3, 0] <= DigitCount[#, 3, 1] <= DigitCount[#, 3, 2] &]

%Y Cf. A007089, A370853, A370854, A370855.

%K nonn,base

%O 1,1

%A _Clark Kimberling_, Mar 03 2024