This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A297236 #4 Jan 17 2018 14:24:09
%S A297236 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 A297236 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 A297236 4,5,6,6,5,4,3,2,1,0,1,2,3,4,5,7,6,5
%N A297236 Total variation of base-12 digits of n; see Comments.
%C A297236 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 A297236 Clark Kimberling, <a href="/A297236/b297236.txt">Table of n, a(n) for n = 1..10000</a>
%e A297236 2^20 in base 12: 4, 2, 6, 9, 9, 4; here, DV = 7 and UV = 7, so that a(2^20) = 14.
%t A297236 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 A297236 Cf. A297234, A297235, A297330.
%K A297236 nonn,base,easy
%O A297236 1,15
%A A297236 _Clark Kimberling_, Jan 17 2018