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)
2 A296858 A296859 A296860
3 A296861 A296862 A296863
4 A296864 A296865 A296866
5 A296867 A296868 A296869
6 A296870 A296871 A296872
7 A296873 A296874 A296875
8 A296876 A296877 A296878
9 A296879 A296880 A296881
10 A296882 A296883 A296884
11 A296885 A296886 A296887
12 A296888 A296889 A296890
13 A296891 A296892 A296893
14 A296894 A296895 A296896
15 A296897 A296898 A296899
16 A296900 A296901 A296902
20 A296903 A296904 A296905
60 A296906 A296907 A296908

Examples

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

Links

Crossrefs

Cf. A296882, A296712, A296883, A296884.

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

A296876 Numbers whose base-8 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, 72, 73, 74
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 A296876-A296878 partition the natural numbers. See the guides at A296882 and A296712.

Examples

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

Links

Crossrefs

Cf. A296882, A296712, A296877, A296878.

Programs

  • Mathematica
    z = 200; b = 8;
d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]];
Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &]  (* A296876 *)
Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &]   (* A296877 *)
Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &]   (* A296878 *)

A296877 Numbers whose base-8 digits d(m), d(m-1), ..., d(0) have #(pits) > #(peaks); see Comments.

Original entry on oeis.org

65, 66, 67, 68, 69, 70, 71, 129, 130, 131, 132, 133, 134, 135, 138, 139, 140, 141, 142, 143, 193, 194, 195, 196, 197, 198, 199, 202, 203, 204, 205, 206, 207, 211, 212, 213, 214, 215, 257, 258, 259, 260, 261, 262, 263, 266, 267, 268, 269, 270, 271, 275, 276
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 A296876-A296878 partition the natural numbers. See the guides at A296882 and A296712.

Examples

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

Links

Crossrefs

Cf. A296882, A296712, A296876, A296878.

Programs

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.