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 A296698 #8 Jan 27 2023 19:22:51 %S A296698 7,8,9,13,14,19,32,33,34,37,38,39,43,44,49,63,64,68,69,74,94,99,132, %T A296698 133,134,138,139,144,157,158,159,162,163,164,168,169,174,176,177,178, %U A296698 179,182,183,184,187,188,189,190,191,192,193,194,195,196,197,198,199 %N A296698 Numbers whose base-5 digits d(m), d(m-1), ... d(0) have #(rises) > #(falls); see Comments. %C A296698 A rise is an index i such that d(i) < d(i+1); a fall is an index i such that d(i) > d(i+1). The sequences A296697-A296699 partition the natural numbers. See the guide at A296712. %H A296698 Clark Kimberling, <a href="/A296698/b296698.txt">Table of n, a(n) for n = 1..10000</a> %e A296698 The base-5 digits of 199 are 1,2,4,4; here #(rises) = 2 and #(falls) = 0, so 199 is in the sequence. %t A296698 z = 200; b = 5; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296698 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296697 *) %t A296698 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296698 *) %t A296698 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296699 *) %Y A296698 Cf. A296697, A296699, A296712. %K A296698 nonn,base %O A296698 1,1 %A A296698 _Clark Kimberling_, Dec 21 2017