login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A296759 Numbers n whose base-16 digits d(m), d(m-1), ..., d(0) have #(rises) = #(falls); see Comments. 4
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 34, 51, 68, 85, 102, 119, 136, 153, 170, 187, 204, 221, 238, 255, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 273, 288, 289, 304, 305, 306, 320, 321, 322, 323, 336, 337 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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 A296759-A296761 partition the natural numbers. See the guide at A296712.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

EXAMPLE

The base-16 digits of 2^20 + 1 are 1, 0, 0, 0, 0, 1; here #(rises) = 1 and #(falls) = 1, so that 2^20 + 1 is in the sequence.

MATHEMATICA

z = 200; b = 16; d[n_] := Sign[Differences[IntegerDigits[n, b]]];

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

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

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

CROSSREFS

Cf. A296760, A296761, A296712.

Sequence in context: A044827 A048313 A043719 * A029730 A297289 A048327

Adjacent sequences:  A296756 A296757 A296758 * A296760 A296761 A296762

KEYWORD

nonn,base,easy

AUTHOR

Clark Kimberling, Jan 08 2018

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 18:59 EDT 2021. Contains 343573 sequences. (Running on oeis4.)