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

A296906 Numbers whose base-60 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 A296906..A296908 partition the natural numbers.
a(n) = n for n = 1..3600, but not for n = 3601. See the guides at A296712 and A296882.

Examples

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

Crossrefs

Programs

  • Mathematica
    z = 200; b = 60;
    d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]];
    Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &]  (* A296906 *)
    Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &]   (* A296907 *)
    Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &]   (* A296908 *)

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

Original entry on oeis.org

3720, 3721, 3780, 3781, 3782, 3840, 3841, 3842, 3843, 3900, 3901, 3902, 3903, 3904, 3960, 3961, 3962, 3963, 3964, 3965, 4020, 4021, 4022, 4023, 4024, 4025, 4026, 4080, 4081, 4082, 4083, 4084, 4085, 4086, 4087, 4140, 4141, 4142, 4143, 4144, 4145, 4146, 4147
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 A296906..A296908 partition the natural numbers. See the guides at A296712 and A296882.

Examples

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

Crossrefs

Programs

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