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.

A296897 Numbers whose base-15 digits d(m), d(m-1), ..., d(0) have #(pits) = #(peaks); see Comments.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67
Offset: 1

Views

Author

Clark Kimberling, Jan 12 2018

Keywords

Comments

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 A296897-A296899 partition the natural numbers. See the guides at A296712 and A296882.

Examples

			The base-15 digits of 3842 are 1,2,1,2; here #(pits) = 1 and #(peaks) = 1, so 3842 is in the sequence.
		

Crossrefs

Programs

  • Mathematica
    z = 200; b = 15;
    d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]];
    Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &]  (* A296897 *)
    Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &]   (* A296898 *)
    Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &]   (* A296899 *)