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 A297242 #4 Jan 17 2018 17:52:28
%S A297242 0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,2,3,4,5,6,7,8,9,10,11,12,2,1,0,1,2,3,
%T A297242 4,5,6,7,8,9,10,11,3,2,1,0,1,2,3,4,5,6,7,8,9,10,4,3,2,1,0,1,2,3,4,5,6,
%U A297242 7,8,9,5,4,3,2,1,0,1,2,3,4,5,6,7,8,6
%N A297242 Total variation of base-14 digits of n; see Comments.
%C A297242 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 A297242 Clark Kimberling, <a href="/A297242/b297242.txt">Table of n, a(n) for n = 1..10000</a>
%e A297242 2^20 in base 14: 1, 13, 4, 1, 12, 4; here, DV = 20 and UV = 23, so that a(2^20) = 43.
%t A297242 b = 14; 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 A297242 Cf. A297240, A297241, A297330.
%K A297242 nonn,base,easy
%O A297242 1,17
%A A297242 _Clark Kimberling_, Jan 17 2018