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 A296752 #7 Jan 27 2023 19:25:58 %S A296752 13,26,27,39,40,41,52,53,54,55,65,66,67,68,69,78,79,80,81,82,83,91,92, %T A296752 93,94,95,96,97,104,105,106,107,108,109,110,111,117,118,119,120,121, %U A296752 122,123,124,125,130,131,132,133,134,135,136,137,138,139,143,144 %N A296752 Numbers whose base-13 digits d(m), d(m-1), ..., d(0) have #(rises) < #(falls); see Comments. %C A296752 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 A296751-A296753 partition the natural numbers. See the guide at A296712. %H A296752 Clark Kimberling, <a href="/A296752/b296752.txt">Table of n, a(n) for n = 1..10000</a> %e A296752 The base-13 digits of 914 are 5,5,4; here #(rises) = 0 and #(falls) = 1, so 914 is in the sequence. %t A296752 z = 200; b = 13; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296752 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296750 *) %t A296752 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296751 *) %t A296752 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296752 *) %Y A296752 Cf. A296750, A296751, A296712. %K A296752 nonn,base,easy %O A296752 1,1 %A A296752 _Clark Kimberling_, Jan 08 2018