A297330 -id:A297330 - cp's OEIS frontend

A297264 Numbers whose base-8 digits have greater down-variation than up-variation; see Comments.

8, 16, 17, 24, 25, 26, 32, 33, 34, 35, 40, 41, 42, 43, 44, 48, 49, 50, 51, 52, 53, 56, 57, 58, 59, 60, 61, 62, 64, 72, 80, 88, 96, 104, 112, 120, 128, 129, 136, 137, 144, 145, 152, 153, 160, 161, 168, 169, 176, 177, 184, 185, 192, 193, 194, 200, 201, 202

Offset: 1

Clark Kimberling, Jan 15 2018

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.

			202 in base-8:  3,1,2, having DV = 2, UV = 1, so that 202 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297265, A297266.

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 = 8; 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]   (* A297264 *)
Take[Flatten[Position[w, 0]], 120]    (* A297265 *)
Take[Flatten[Position[w, 1]], 120]    (* A297266 *)

A297265 Numbers whose base-8 digits have equal down-variation and up-variation; see Comments.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 18, 27, 36, 45, 54, 63, 65, 73, 81, 89, 97, 105, 113, 121, 130, 138, 146, 154, 162, 170, 178, 186, 195, 203, 211, 219, 227, 235, 243, 251, 260, 268, 276, 284, 292, 300, 308, 316, 325, 333, 341, 349, 357, 365, 373, 381, 390, 398, 406

Offset: 1

Clark Kimberling, Jan 15 2018

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.

a(n) = A029803(n+1) for 1 <= n < 72, but a(72) = 521 differs from A029803(73) = 585. - Georg Fischer, Oct 30 2018

			406 in base-8:  6,2,6, having DV = 4, UV = 4, so that 406 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297264, A297266.

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 = 8; 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]   (* A297264 *)
Take[Flatten[Position[w, 0]], 120]    (* A297265 *)
Take[Flatten[Position[w, 1]], 120]    (* A297266 *)

A297266 Numbers whose base-8 digits have greater up-variation than down-variation; see Comments.

Original entry on oeis.org

10, 11, 12, 13, 14, 15, 19, 20, 21, 22, 23, 28, 29, 30, 31, 37, 38, 39, 46, 47, 55, 66, 67, 68, 69, 70, 71, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 90, 91, 92, 93, 94, 95, 98, 99, 100, 101, 102, 103, 106, 107, 108, 109, 110, 111, 114, 115, 116, 117

Offset: 1

Clark Kimberling, Jan 15 2018

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.

			111 in base-8:  1,5,7, having DV = 0, UV = 6, so that 111 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297264, A297265.

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 = 8; 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]   (* A297264 *)
Take[Flatten[Position[w, 0]], 120]    (* A297265 *)
Take[Flatten[Position[w, 1]], 120]    (* A297266 *)

A297267 Numbers whose base-9 digits have greater down-variation than up-variation; see Comments.

Original entry on oeis.org

9, 18, 19, 27, 28, 29, 36, 37, 38, 39, 45, 46, 47, 48, 49, 54, 55, 56, 57, 58, 59, 63, 64, 65, 66, 67, 68, 69, 72, 73, 74, 75, 76, 77, 78, 79, 81, 90, 99, 108, 117, 126, 135, 144, 153, 162, 163, 171, 172, 180, 181, 189, 190, 198, 199, 207, 208, 216, 217, 225

Offset: 1

Clark Kimberling, Jan 15 2018

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.

			225 in base-9:  2,7,0, having DV = 7, UV = 5, so that 225 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297268, A297269.

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 = 9; 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]   (* A297267 *)
Take[Flatten[Position[w, 0]], 120]    (* A297268 *)
Take[Flatten[Position[w, 1]], 120]    (* A297269 *)

A297268 Numbers whose base-9 digits have equal down-variation and up-variation; see Comments.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 20, 30, 40, 50, 60, 70, 80, 82, 91, 100, 109, 118, 127, 136, 145, 154, 164, 173, 182, 191, 200, 209, 218, 227, 236, 246, 255, 264, 273, 282, 291, 300, 309, 318, 328, 337, 346, 355, 364, 373, 382, 391, 400, 410, 419, 428, 437, 446

Offset: 1

Clark Kimberling, Jan 15 2018

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 A029955 first at 739=1011_9 which is not a palindrome in base 9 but has DV(739,9)=UV(793,9) =1. - R. J. Mathar, Jan 23 2018

			446 in base-9:  5,4,5, having DV = 1, UV = 1, so that 446 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297267, A297269.

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 = 9; 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]   (* A297267 *)
Take[Flatten[Position[w, 0]], 120]    (* A297268 *)
Take[Flatten[Position[w, 1]], 120]    (* A297269 *)

A297269 Numbers whose base-9 digits have greater up-variation than down-variation; see Comments.

Original entry on oeis.org

11, 12, 13, 14, 15, 16, 17, 21, 22, 23, 24, 25, 26, 31, 32, 33, 34, 35, 41, 42, 43, 44, 51, 52, 53, 61, 62, 71, 83, 84, 85, 86, 87, 88, 89, 92, 93, 94, 95, 96, 97, 98, 101, 102, 103, 104, 105, 106, 107, 110, 111, 112, 113, 114, 115, 116, 119, 120, 121, 122

Offset: 1

Clark Kimberling, Jan 15 2018

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.

			122 in base-9:  1,4,5, having DV = 0, UV = 4, so that 122 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297267, A297268.

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 = 9; 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]   (* A297267 *)
Take[Flatten[Position[w, 0]], 120]    (* A297268 *)
Take[Flatten[Position[w, 1]], 120]    (* A297269 *)

A297270 Numbers whose base-10 digits have greater down-variation than up-variation; see Comments.

Original entry on oeis.org

10, 20, 21, 30, 31, 32, 40, 41, 42, 43, 50, 51, 52, 53, 54, 60, 61, 62, 63, 64, 65, 70, 71, 72, 73, 74, 75, 76, 80, 81, 82, 83, 84, 85, 86, 87, 90, 91, 92, 93, 94, 95, 96, 97, 98, 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 201, 210, 211, 220, 221

Offset: 1

Clark Kimberling, Jan 16 2018

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 first from A071590 at 1101, which is in A071590, but not in here because UV(1101) = DV(1101). - R. J. Mathar, Jan 23 2018

			6151413121 in base-10:  6,1,5,1,4,1,3,1,2,1, having DV = 15, UV = 10, so that 6151413121 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297271, A297272.

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 = 10; 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]   (* A297270 *)
Take[Flatten[Position[w, 0]], 120]    (* A297271 *)
Take[Flatten[Position[w, 1]], 120]    (* A297272 *)

A297272 Numbers whose base-10 digits have greater up-variation than down-variation; see Comments.

Original entry on oeis.org

12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 25, 26, 27, 28, 29, 34, 35, 36, 37, 38, 39, 45, 46, 47, 48, 49, 56, 57, 58, 59, 67, 68, 69, 78, 79, 89, 102, 103, 104, 105, 106, 107, 108, 109, 112, 113, 114, 115, 116, 117, 118, 119, 122, 123, 124, 125, 126, 127, 128

Offset: 1

Clark Kimberling, Jan 16 2018

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 A071589 first at 1011 which is in A071589 but not in here because UV(1011) = DV(1011)=1. - R. J. Mathar, Jan 23 2018

			198765 in base-10:  1,9,8,7,6,5, having DV = 4, UV = 8, so that 198765 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297270, A297271.

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 = 10; 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]   (* A297270 *)
Take[Flatten[Position[w, 0]], 120]    (* A297271 *)
Take[Flatten[Position[w, 1]], 120]    (* A297272 *)

A297273 Numbers whose base-11 digits have greater down-variation than up-variation; see Comments.

Original entry on oeis.org

11, 22, 23, 33, 34, 35, 44, 45, 46, 47, 55, 56, 57, 58, 59, 66, 67, 68, 69, 70, 71, 77, 78, 79, 80, 81, 82, 83, 88, 89, 90, 91, 92, 93, 94, 95, 99, 100, 101, 102, 103, 104, 105, 106, 107, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 121, 132, 143, 154

Offset: 1

Clark Kimberling, Jan 16 2018

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.

			154 in base-11:  1,3,0, having DV = 3, UV = 2, so that 154 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297274, A297275.

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 = 11; 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]   (* A297273 *)
Take[Flatten[Position[w, 0]], 120]    (* A297274 *)
Take[Flatten[Position[w, 1]], 120]    (* A297275 *)

A297274 Numbers whose base-11 digits have equal down-variation and up-variation; see Comments.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 24, 36, 48, 60, 72, 84, 96, 108, 120, 122, 133, 144, 155, 166, 177, 188, 199, 210, 221, 232, 244, 255, 266, 277, 288, 299, 310, 321, 332, 343, 354, 366, 377, 388, 399, 410, 421, 432, 443, 454, 465, 476, 488, 499, 510, 521

Offset: 1

Clark Kimberling, Jan 16 2018

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 after the zero from A029956 first at 1343 = 1011_11, which is not a palindrome in base 11 but has DV(1343,11) = UV(1343,11) =1. - R. J. Mathar, Jan 23 2018

			521 in base-11:  4,3,4, having DV = 1, UV = 1, so that 521 is in the sequence.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A297330, A297273, A297275.

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 = 11; 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]   (* A297273 *)
Take[Flatten[Position[w, 0]], 120]    (* A297274 *)
Take[Flatten[Position[w, 1]], 120]    (* A297275 *)

cp's OEIS Frontend

A297264 Numbers whose base-8 digits have greater down-variation than up-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297265 Numbers whose base-8 digits have equal down-variation and up-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297266 Numbers whose base-8 digits have greater up-variation than down-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297267 Numbers whose base-9 digits have greater down-variation than up-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297268 Numbers whose base-9 digits have equal down-variation and up-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297269 Numbers whose base-9 digits have greater up-variation than down-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297270 Numbers whose base-10 digits have greater down-variation than up-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297272 Numbers whose base-10 digits have greater up-variation than down-variation; see Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs