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.

Showing 1-3 of 3 results.

A296882 Numbers whose base-10 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 10 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 A296882-A296883 partition the natural numbers. See the guides at A296712. We have a(n) = A000027(n) for n=1..100 but not n=101.
.
Guide to related sequences:
Base #(pits) = #(peaks) #(pits) > #(peaks) #(pits) < #(peaks)

Examples

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

Crossrefs

Programs

  • Mathematica
    z = 200; b = 10;
    d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]];
    Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &]  (* A296882 *)
    Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &]   (* A296883 *)
    Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &]   (* A296884 *)

Extensions

Overview table corrected by Georg Fischer, Aug 24 2021

A296870 Numbers whose base-6 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, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 57, 58, 59, 64, 65, 71, 72, 78, 79, 84, 85, 86, 87, 88, 89, 93, 94, 95, 100, 101
Offset: 1

Views

Author

Clark Kimberling, Jan 09 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 A296870-A296872 partition the natural numbers. See the guides at A296882 and A296712.

Examples

			The base-6 digits of 101 are 2,4,5; here #(pits) = 0 and #(peaks) = 0, so 101 is in the sequence.
		

Crossrefs

Programs

  • Mathematica
    z = 200; b = 6;
    d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]];
    Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &]  (* A296870 *)
    Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &]   (* A296871 *)
    Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &]   (* A296872 *)

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

Original entry on oeis.org

48, 49, 54, 55, 56, 60, 61, 62, 63, 66, 67, 68, 69, 70, 90, 91, 92, 96, 97, 98, 99, 102, 103, 104, 105, 106, 132, 133, 134, 135, 138, 139, 140, 141, 142, 174, 175, 176, 177, 178, 264, 265, 270, 271, 272, 276, 277, 278, 279, 282, 283, 284, 285, 286, 288, 294
Offset: 1

Views

Author

Clark Kimberling, Jan 09 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 A296870-A296872 partition the natural numbers. See the guides at A296882 and A296712.

Examples

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

Crossrefs

Programs

  • Mathematica
    z = 200; b = 6;
    d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]];
    Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &]  (* A296870 *)
    Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &]   (* A296871 *)
    Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &]   (* A296872 *)
Showing 1-3 of 3 results.