login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A296752 Numbers whose base-13 digits d(m), d(m-1), ..., d(0) have #(rises) < #(falls); see Comments. 5

%I #7 Jan 27 2023 19:25:58

%S 13,26,27,39,40,41,52,53,54,55,65,66,67,68,69,78,79,80,81,82,83,91,92,

%T 93,94,95,96,97,104,105,106,107,108,109,110,111,117,118,119,120,121,

%U 122,123,124,125,130,131,132,133,134,135,136,137,138,139,143,144

%N Numbers whose base-13 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 A296751-A296753 partition the natural numbers. See the guide at A296712.

%H Clark Kimberling, <a href="/A296752/b296752.txt">Table of n, a(n) for n = 1..10000</a>

%e The base-13 digits of 914 are 5,5,4; here #(rises) = 0 and #(falls) = 1, so 914 is in the sequence.

%t z = 200; b = 13; d[n_] := Sign[Differences[IntegerDigits[n, b]]];

%t Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296750 *)

%t Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &] (* A296751 *)

%t Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &] (* A296752 *)

%Y Cf. A296750, A296751, A296712.

%K nonn,base,easy

%O 1,1

%A _Clark Kimberling_, Jan 08 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 12:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)