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 A296761 #8 Jan 27 2023 19:51:28 %S A296761 16,32,33,48,49,50,64,65,66,67,80,81,82,83,84,96,97,98,99,100,101,112, %T A296761 113,114,115,116,117,118,128,129,130,131,132,133,134,135,144,145,146, %U A296761 147,148,149,150,151,152,160,161,162,163,164,165,166,167,168,169 %N A296761 Numbers whose base-16 digits d(m), d(m-1), ..., d(0) have #(rises) < #(falls); see Comments. %C A296761 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 A296759-A296761 partition the natural numbers. See the guide at A296712. %H A296761 Clark Kimberling, <a href="/A296761/b296761.txt">Table of n, a(n) for n = 1..10000</a> %e A296761 The base-16 digits of 32 are 2,0; here #(rises) = 0 and #(falls) = 2, so 32 is in the sequence. %t A296761 z = 200; b = 16; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296761 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296759 *) %t A296761 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296760 *) %t A296761 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296761 *) %Y A296761 Cf. A296759, A296760, A296712. %K A296761 nonn,base,easy %O A296761 1,1 %A A296761 _Clark Kimberling_, Jan 08 2018