login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297232 Up-variation of the base-11 digits of n; see Comments. 4
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,14
COMMENTS
Suppose that a number 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). Every positive integer occurs infinitely many times. See A297330 for a guide to related sequences and partitions of the natural numbers.
LINKS
EXAMPLE
15 in base 11: 1,4; here UV = 3, so that a(15) = 3.
MATHEMATICA
g[n_, b_] := Differences[IntegerDigits[n, b]];
b = 11; z = 120; Table[-Total[Select[g[n, b], # < 0 &]], {n, 1, z}]; (* A297231 *)
Table[Total[Select[g[n, b], # > 0 &]], {n, 1, z}]; (* A297232 *)
CROSSREFS
Sequence in context: A128557 A265542 A103303 * A093691 A004176 A085124
KEYWORD
nonn,base,easy
AUTHOR
Clark Kimberling, Jan 17 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)