The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297235 Up-variation of the base-12 digits of n; see Comments. 4
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,15 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 Clark Kimberling, Table of n, a(n) for n = 1..10000 EXAMPLE 16 in base 12: 1,4; here UV = 3, so that a(16) = 3. MATHEMATICA g[n_, b_] := Differences[IntegerDigits[n, b]]; b = 12; z = 120; Table[-Total[Select[g[n, b], # < 0 &]], {n, 1, z}];  (* A297234 *) Table[Total[Select[g[n, b], # > 0 &]], {n, 1, z}]; (* A297235 *) CROSSREFS Cf. A297234, A297235, A297330. Sequence in context: A262040 A329200 A122638 * A090175 A275010 A010880 Adjacent sequences:  A297232 A297233 A297234 * A297236 A297237 A297238 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 1 12:46 EDT 2020. Contains 334762 sequences. (Running on oeis4.)