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 A296760 #14 Nov 26 2023 13:03:34 %S A296760 18,19,20,21,22,23,24,25,26,27,28,29,30,31,35,36,37,38,39,40,41,42,43, %T A296760 44,45,46,47,52,53,54,55,56,57,58,59,60,61,62,63,69,70,71,72,73,74,75, %U A296760 76,77,78,79,86,87,88,89,90,91,92,93,94,95,103,104,105,106 %N A296760 Numbers whose base-16 digits d(m), d(m-1), ..., d(0) have #(rises) > #(falls); see Comments. %C A296760 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 A296760 Clark Kimberling, <a href="/A296760/b296760.txt">Table of n, a(n) for n = 1..10000</a> %e A296760 The base-16 digits of 106 are 6,10; here #(rises) = 1 and #(falls) = 0, so 106 is in the sequence. %t A296760 z = 200; b = 16; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296760 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296759 *) %t A296760 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296760 *) %t A296760 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296761 *) %t A296760 rgf16Q[n_]:=Total[Sign[#]&/@Differences[IntegerDigits[n,16]]]>0;Select[Range[150],rgf16Q] (* _Harvey P. Dale_, Nov 26 2023 *) %Y A296760 Cf. A296759, A296761, A296712. %K A296760 nonn,base,easy %O A296760 1,1 %A A296760 _Clark Kimberling_, Jan 08 2018