cp's OEIS Frontend

A297246 Down-variation of the base-16 digits of n; see Comments.

%I A297246 #5 Jan 18 2018 19:35:28
%S A297246 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,0,
%T A297246 0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,4,3,2,1,0,
%U A297246 0,0,0,0,0,0,0,0,0,0,0,5,4,3,2,1,0,0
%N A297246 Down-variation of the base-16 digits of n; see Comments.
%C A297246 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.
%H A297246 Clark Kimberling, <a href="/A297246/b297246.txt">Table of n, a(n) for n = 1..10000</a>
%e A297246 32 in base 15: 2,0; here DV = 2, so that a(32) = 2.
%t A297246 g[n_, b_] := Differences[IntegerDigits[n, b]];
%t A297246 b = 16; z = 120; Table[-Total[Select[g[n, b], # < 0 &]], {n, 1, z}];  (* A297246 *)
%t A297246 Table[Total[Select[g[n, b], # > 0 &]], {n, 1, z}]; (* A297247 *)
%Y A297246 Cf. A297247, A297248, A297330.
%K A297246 nonn,base,easy
%O A297246 1,32
%A A297246 _Clark Kimberling_, Jan 18 2018