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 A296757 #7 Jan 27 2023 19:26:52 %S A296757 17,18,19,20,21,22,23,24,25,26,27,28,29,33,34,35,36,37,38,39,40,41,42, %T A296757 43,44,49,50,51,52,53,54,55,56,57,58,59,65,66,67,68,69,70,71,72,73,74, %U A296757 81,82,83,84,85,86,87,88,89,97,98,99,100,101,102,103,104 %N A296757 Numbers whose base-15 digits d(m), d(m-1), ..., d(0) have #(rises) > #(falls); see Comments. %C A296757 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 A296756-A296758 partition the natural numbers. See the guide at A296712. %H A296757 Clark Kimberling, <a href="/A296757/b296757.txt">Table of n, a(n) for n = 1..10000</a> %e A296757 The base-15 digits of 2^20 + 6 are 1, 5, 10, 10, 5, 7; here #(rises) = 3 and #(falls) = 1, so 2^20 + 6 is in the sequence. %t A296757 z = 200; b = 15; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296757 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296756 *) %t A296757 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296757 *) %t A296757 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296758 *) %Y A296757 Cf. A296756, A296758, A296712. %K A296757 nonn,base,easy %O A296757 1,1 %A A296757 _Clark Kimberling_, Jan 08 2018