|
%I #7 Jan 27 2023 19:09:50
%S 8,9,10,11,15,16,17,22,23,29,44,45,46,47,50,51,52,53,57,58,59,64,65,
%T 71,87,88,89,93,94,95,100,101,107,130,131,136,137,143,173,179,224,225,
%U 226,227,231,232,233,238,239,245,260,261,262,263,266,267,268,269
%N Numbers whose base-6 digits d(m), d(m-1), ... d(0) have #(rises) > #(falls); see Comments.
%C 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 A296700-A296702 partition the natural numbers. See the guide at A296712.
%H Clark Kimberling, <a href="/A296701/b296701.txt">Table of n, a(n) for n = 1..10000</a>
%e The base-6 digits of 269 are 1, 1, 2, 5; here #(rises) = 2 and #(falls) = 0, so 269 is in the sequence.
%t z = 200; b = 6; d[n_] := Sign[Differences[IntegerDigits[n, b]]];
%t Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296700 *)
%t Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296701 *)
%t Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296702 *)
%Y Cf. A296700, A296702, A296712.
%K nonn,easy,base
%O 1,1
%A _Clark Kimberling_, Jan 07 2018
|
