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 A296748 #7 Jan 27 2023 19:25:22 %S A296748 14,15,16,17,18,19,20,21,22,23,27,28,29,30,31,32,33,34,35,40,41,42,43, %T A296748 44,45,46,47,53,54,55,56,57,58,59,66,67,68,69,70,71,79,80,81,82,83,92, %U A296748 93,94,95,105,106,107,118,119,131,158,159,160,161,162,163 %N A296748 Numbers whose base-12 digits d(m), d(m-1), ..., d(0) have #(rises) > #(falls); see Comments. %C A296748 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 A296747-A296749 partition the natural numbers. See the guide at A296712. %H A296748 Clark Kimberling, <a href="/A296748/b296748.txt">Table of n, a(n) for n = 1..10000</a> %e A296748 The base-12 digits of 163 are 1,1,7; here #(rises) = 1 and #(falls) = 0, so 163 is in the sequence. %t A296748 z = 200; b = 12; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296748 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296747 *) %t A296748 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296748 *) %t A296748 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296749 *) %Y A296748 Cf. A296747, A296749, A296712. %K A296748 nonn,base,easy %O A296748 1,1 %A A296748 _Clark Kimberling_, Jan 08 2018