cp's OEIS Frontend

A297234 Down-variation of the base-12 digits of n; see Comments.

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