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!)
A296881 Numbers whose base-9 digits d(m), d(m-1), ..., d(0) have #(pits) < #(peaks); see Comments. 4

%I #7 Jan 21 2023 18:04:55

%S 99,100,108,109,110,117,118,119,120,126,127,128,129,130,135,136,137,

%T 138,139,140,144,145,146,147,148,149,150,153,154,155,156,157,158,159,

%U 160,189,190,191,198,199,200,201,207,208,209,210,211,216,217,218,219,220

%N Numbers whose base-9 digits d(m), d(m-1), ..., d(0) have #(pits) < #(peaks); see Comments.

%C A pit is an index i such that d(i-1) > d(i) < d(i+1); a peak is an index i such that d(i-1) < d(i) > d(i+1). The sequences A296879-A296881 partition the natural numbers. See the guides at A296882 and A296712.

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

%e The base-9 digits of 220 are 2,6,4; here #(pits) = 0 and #(peaks) = 1, so 220 is in the sequence.

%t z = 200; b = 9;

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

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

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

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

%Y Cf. A296882, A296712, A296879, A296880.

%K nonn,base,easy

%O 1,1

%A _Clark Kimberling_, Jan 10 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 23 12:08 EDT 2024. Contains 371912 sequences. (Running on oeis4.)