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 A296889 #7 Jan 21 2023 19:48:51 %S A296889 145,146,147,148,149,150,151,152,153,154,155,289,290,291,292,293,294, %T A296889 295,296,297,298,299,302,303,304,305,306,307,308,309,310,311,433,434, %U A296889 435,436,437,438,439,440,441,442,443,446,447,448,449,450,451,452,453,454 %N A296889 Numbers whose base-12 digits d(m), d(m-1), ..., d(0) have #(pits) > #(peaks); see Comments. %C A296889 A pit is an index i such that d(i-1) > d(i) < d(i+1); a peak is an index i such that d(i-1) < d(i) > d(i+1). The sequences A296888-A296890 partition the natural numbers. See the guides at A296712 and A296882. %H A296889 Clark Kimberling, <a href="/A296889/b296889.txt">Table of n, a(n) for n = 1..10000</a> %e A296889 The base-12 digits of 43502 are 2,1,2,1,2; here #(pits) = 2 and #(peaks) = 1, so 43502 is in the sequence. %t A296889 z = 200; b = 12; %t A296889 d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]]; %t A296889 Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &] (* A296888 *) %t A296889 Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &] (* A296889 *) %t A296889 Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &] (* A296890 *) %Y A296889 Cf. A296882, A296712, A296888, A296890. %K A296889 nonn,base,easy %O A296889 1,1 %A A296889 _Clark Kimberling_, Jan 10 2018