cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A296712 Numbers whose base-10 digits d(m), d(m-1), ..., d(0) have #(rises) = #(falls); see Comments.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 102, 103, 104, 105, 106, 107, 108, 109, 111, 120, 121, 130, 131, 132, 140, 141, 142, 143, 150, 151, 152, 153, 154, 160, 161, 162, 163, 164, 165, 170, 171, 172, 173, 174, 175, 176, 180, 181
Offset: 1

Views

Author

Clark Kimberling, Jan 08 2018

Keywords

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 A296712-A296714 partition the natural numbers.
****
Guide to related sequences:
Base #(rises) = #(falls) #(rises) > #(falls) #(rises) < #(falls)
2 A005408 (none) A005843

Examples

			The base-10 digits of 181 are 1,8,1; here #(rises) = 1 and #(falls) = 1, so 181 is in the sequence.
		

Crossrefs

Programs

  • Mathematica
    z = 200; b = 10; d[n_] := Sign[Differences[IntegerDigits[n, b]]];
    Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296712 *)
    Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &]  (* A296713 *)
    Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &]  (* A296714 *)