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 A296763 #7 Jan 22 2023 18:56:05 %S A296763 22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,43,44,45,46,47, %T A296763 48,49,50,51,52,53,54,55,56,57,58,59,64,65,66,67,68,69,70,71,72,73,74, %U A296763 75,76,77,78,79,85,86,87,88,89,90,91,92,93,94,95,96,97,98 %N A296763 Numbers whose base-20 digits d(m), d(m-1), ..., d(0) have #(rises) > #(falls); see Comments. %C A296763 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 A296762-A296764 partition the natural numbers. See the guide at A296712. %H A296763 Clark Kimberling, <a href="/A296763/b296763.txt">Table of n, a(n) for n = 1..10000</a> %e A296763 The base-20 digits of 98 are 4,18; here #(rises) = 1 and #(falls) = 0, so 98 is in the sequence. %t A296763 z = 200; b = 20; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296763 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296762 *) %t A296763 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296763 *) %t A296763 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296764 *) %Y A296763 Cf. A296762, A296764, A296712. %K A296763 nonn,base,easy %O A296763 1,1 %A A296763 _Clark Kimberling_, Jan 08 2018