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-4 of 4 results.

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
3 A296691 A296692 A296693
4 A296694 A296695 A296696
5 A296697 A296698 A296699
6 A296700 A296701 A296702
7 A296703 A296704 A296705
8 A296706 A296707 A296708
9 A296709 A296710 A296711
10 A296712 A296713 A296714
11 A296744 A296745 A296746
12 A296747 A296748 A296749
13 A296750 A296751 A296752
14 A296753 A296754 A296755
15 A296756 A296757 A296758
16 A296759 A296760 A296761
20 A296762 A296763 A296764
60 A296765 A296766 A296767

Examples

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

Links

Crossrefs

Cf. A296713, A296714, A296712.

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 *)

A296760 Numbers whose base-16 digits d(m), d(m-1), ..., d(0) have #(rises) > #(falls); see Comments.

Original entry on oeis.org

18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 103, 104, 105, 106
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 A296759-A296761 partition the natural numbers. See the guide at A296712.

Examples

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

Links

Crossrefs

Cf. A296759, A296761, A296712.

Programs

  • Mathematica
    z = 200; b = 16; d[n_] := Sign[Differences[IntegerDigits[n, b]]];
Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296759 *)
Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &]  (* A296760 *)
Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &]  (* A296761 *)
rgf16Q[n_]:=Total[Sign[#]&/@Differences[IntegerDigits[n,16]]]>0;Select[Range[150],rgf16Q] (* Harvey P. Dale, Nov 26 2023 *)

A296759 Numbers whose base-16 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, 10, 11, 12, 13, 14, 15, 17, 34, 51, 68, 85, 102, 119, 136, 153, 170, 187, 204, 221, 238, 255, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 273, 288, 289, 304, 305, 306, 320, 321, 322, 323, 336, 337
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 A296759-A296761 partition the natural numbers. See the guide at A296712.

Examples

			The base-16 digits of 2^20 + 1 are 1, 0, 0, 0, 0, 1; here #(rises) = 1 and #(falls) = 1, so 2^20 + 1 is in the sequence.

Links

Crossrefs

Cf. A296760, A296761, A296712.

Programs

  • Mathematica
    z = 200; b = 16; d[n_] := Sign[Differences[IntegerDigits[n, b]]];
Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296759 *)
Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &]  (* A296760 *)
Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &]  (* A296761 *)
Select[Range[400],Total[Sign[Differences[IntegerDigits[#,16]]]]==0&] (* Harvey P. Dale, Aug 11 2021 *)

A297288 Numbers whose base-16 digits have greater down-variation than up-variation; see Comments.

Original entry on oeis.org

16, 32, 33, 48, 49, 50, 64, 65, 66, 67, 80, 81, 82, 83, 84, 96, 97, 98, 99, 100, 101, 112, 113, 114, 115, 116, 117, 118, 128, 129, 130, 131, 132, 133, 134, 135, 144, 145, 146, 147, 148, 149, 150, 151, 152, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169
Offset: 1

Views

Author

Clark Kimberling, Jan 17 2018

Keywords

Comments

Suppose that n has base-b digits b(m), b(m-1), ..., b(0). The base-b down-variation of n is the sum DV(n,b) of all d(i)-d(i-1) for which d(i) > d(i-1); the base-b up-variation of n is the sum UV(n,b) of all d(k-1)-d(k) for which d(k) < d(k-1). The total base-b variation of n is the sum TV(n,b) = DV(n,b) + UV(n,b). See the guide at A297330.
Differs from A296761 first at 288 = 120_16, which has the same number of rises and falls (so not in A296761) but DV =2 > UV =1 (so in this sequence). - R. J. Mathar, Jan 23 2018

Examples

			169 in base-16:  10,9 having DV = 1, UV = 0, so that 169 is in the sequence.

Links

Crossrefs

Cf. A297330, A297289, A297290.

Programs

  • Mathematica
    g[n_, b_] := Map[Total, GatherBy[Differences[IntegerDigits[n, b]], Sign]];
x[n_, b_] := Select[g[n, b], # < 0 &]; y[n_, b_] := Select[g[n, b], # > 0 &];
b = 16; z = 2000; p = Table[x[n, b], {n, 1, z}]; q = Table[y[n, b], {n, 1, z}];
w = Sign[Flatten[p /. {} -> {0}] + Flatten[q /. {} -> {0}]];
Take[Flatten[Position[w, -1]], 120]   (* A297288 *)
Take[Flatten[Position[w, 0]], 120]    (* A297289 *)
Take[Flatten[Position[w, 1]], 120]    (* A297290 *)
Showing 1-4 of 4 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.