cp's OEIS Frontend

A297243 Down-variation of the base-15 digits of n; see Comments.

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