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 A296767 #7 Jan 22 2023 18:58:32 %S A296767 60,120,121,180,181,182,240,241,242,243,300,301,302,303,304,360,361, %T A296767 362,363,364,365,420,421,422,423,424,425,426,480,481,482,483,484,485, %U A296767 486,487,540,541,542,543,544,545,546,547,548,600,601,602,603,604,605,606 %N A296767 Numbers whose base-60 digits d(m), d(m-1), ..., d(0) have #(rises) < #(falls); see Comments. %C A296767 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 A296767 Clark Kimberling, <a href="/A296767/b296767.txt">Table of n, a(n) for n = 1..10000</a> %e A296767 The base-60 digits of 10921 are 3, 2, 1; here #(rises) = 0 and #(falls) = 2, so 10921 is in the sequence. %t A296767 z = 200; b = 60; d[n_] := Sign[Differences[IntegerDigits[n, b]]]; %t A296767 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296765 *) %t A296767 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296766 *) %t A296767 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296767 *) %Y A296767 Cf. A296765, A296766, A296712. %K A296767 nonn,base,easy %O A296767 1,1 %A A296767 _Clark Kimberling_, Jan 08 2018