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!)
A296745 Numbers whose base-11 digits d(m), d(m-1), ..., d(0) have #(rises) > #(falls); see Comments. 4

%I #7 Jan 27 2023 18:55:50

%S 13,14,15,16,17,18,19,20,21,25,26,27,28,29,30,31,32,37,38,39,40,41,42,

%T 43,49,50,51,52,53,54,61,62,63,64,65,73,74,75,76,85,86,87,97,98,109,

%U 134,135,136,137,138,139,140,141,142,145,146,147,148,149,150

%N Numbers whose base-11 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 A296744-A296746 partition the natural numbers. See the guide at A296712.

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

%e The base-11 digits of 150 are 1,2,7; here #(rises) = 2 and #(falls) = 0, so 150 is in the sequence.

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

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

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

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

%Y Cf. A296744, A296746, 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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)