Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Jan 17 2018 14:24:09
%S 0,0,0,0,0,0,0,0,0,0,0,1,0,1,2,3,4,5,6,7,8,9,10,2,1,0,1,2,3,4,5,6,7,8,
%T 9,3,2,1,0,1,2,3,4,5,6,7,8,4,3,2,1,0,1,2,3,4,5,6,7,5,4,3,2,1,0,1,2,3,
%U 4,5,6,6,5,4,3,2,1,0,1,2,3,4,5,7,6,5
%N Total variation of base-12 digits of n; see Comments.
%C 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). See A297330 for a guide to related sequences and partitions of the natural numbers:
%H Clark Kimberling, <a href="/A297236/b297236.txt">Table of n, a(n) for n = 1..10000</a>
%e 2^20 in base 12: 4, 2, 6, 9, 9, 4; here, DV = 7 and UV = 7, so that a(2^20) = 14.
%t b = 12; z = 120; t = Table[Total@Flatten@Map[Abs@Differences@# &, Partition[IntegerDigits[n, b], 2, 1]], {n, z}] (* cf. Michael De Vlieger, e.g. A037834 *)
%Y Cf. A297234, A297235, A297330.
%K nonn,base,easy
%O 1,15
%A _Clark Kimberling_, Jan 17 2018