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 A296706 #7 Jan 27 2023 19:23:14 %S A296706 1,2,3,4,5,6,7,9,18,27,36,45,54,63,65,66,67,68,69,70,71,73,80,81,88, %T A296706 89,90,96,97,98,99,104,105,106,107,108,112,113,114,115,116,117,120, %U A296706 121,122,123,124,125,126,129,130,131,132,133,134,135,138,139,140 %N A296706 Numbers whose base-8 digits d(m), d(m-1), ..., d(0) have #(rises) = #(falls); see Comments. %C A296706 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 A296706-A296707 partition the natural numbers. See the guide at A296712. %H A296706 Clark Kimberling, <a href="/A296706/b296706.txt">Table of n, a(n) for n = 1..10000</a> %e A296706 The base-8 digits of 140 are 2,1,4; here #(rises) = 1 and #(falls) = 1, so 140 is in the sequence. %t A296706 z = 200; b = 8; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296706 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296706 *) %t A296706 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296707 *) %t A296706 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296708 *) %Y A296706 Cf. A296707, A296708, A296712. %K A296706 nonn,easy,base %O A296706 1,2 %A A296706 _Clark Kimberling_, Jan 08 2018