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 A296899 #7 Jan 21 2023 18:17:49 %S A296899 255,256,270,271,272,285,286,287,288,300,301,302,303,304,315,316,317, %T A296899 318,319,320,330,331,332,333,334,335,336,345,346,347,348,349,350,351, %U A296899 352,360,361,362,363,364,365,366,367,368,375,376,377,378,379,380,381,382 %N A296899 Numbers whose base-15 digits d(m), d(m-1), ..., d(0) have #(pits) < #(peaks); see Comments. %C A296899 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 A296897-A296899 partition the natural numbers. See the guides at A296712 and A296882. %H A296899 Clark Kimberling, <a href="/A296899/b296899.txt">Table of n, a(n) for n = 1..10000</a> %e A296899 The base-15 digits of 57631 are 1,2,1,2,1; here #(pits) = 1 and #(peaks) = 2, so 57631 is in the sequence. %t A296899 z = 200; b = 15; %t A296899 d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]]; %t A296899 Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &] (* A296897 *) %t A296899 Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &] (* A296898 *) %t A296899 Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &] (* A296899 *) %Y A296899 Cf. A296882, A296712, A296897, A296898. %K A296899 nonn,base,easy %O A296899 1,1 %A A296899 _Clark Kimberling_, Jan 12 2018