cp's OEIS Frontend

A297283 Numbers whose base-14 digits have equal down-variation and up-variation; see Comments.

%I A297283 #8 Jan 23 2018 20:11:23
%S A297283 1,2,3,4,5,6,7,8,9,10,11,12,13,15,30,45,60,75,90,105,120,135,150,165,
%T A297283 180,195,197,211,225,239,253,267,281,295,309,323,337,351,365,379,394,
%U A297283 408,422,436,450,464,478,492,506,520,534,548,562,576,591,605,619
%N A297283 Numbers whose base-14 digits have equal down-variation and up-variation; see Comments.
%C A297283 Suppose that 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 the guide at A297330.
%C A297283 Differs first from A029959 after the zero for 2759 = 1011_14, which is not a palindrome in base 14 but has UV(2759,14) = DV(2759,14) = 1. - _R. J. Mathar_, Jan 23 2018
%H A297283 Clark Kimberling, <a href="/A297283/b297283.txt">Table of n, a(n) for n = 1..10000</a>
%e A297283 619 in base-14:  3,2,3 having DV = 1, UV = 1, so that 619 is in the sequence.
%t A297283 g[n_, b_] := Map[Total, GatherBy[Differences[IntegerDigits[n, b]], Sign]];
%t A297283 x[n_, b_] := Select[g[n, b], # < 0 &]; y[n_, b_] := Select[g[n, b], # > 0 &];
%t A297283 b = 14; z = 2000; p = Table[x[n, b], {n, 1, z}]; q = Table[y[n, b], {n, 1, z}];
%t A297283 w = Sign[Flatten[p /. {} -> {0}] + Flatten[q /. {} -> {0}]];
%t A297283 Take[Flatten[Position[w, -1]], 120]   (* A297282 *)
%t A297283 Take[Flatten[Position[w, 0]], 120]    (* A297283 *)
%t A297283 Take[Flatten[Position[w, 1]], 120]    (* A297284 *)
%Y A297283 Cf. A297330, A297282, A297284.
%K A297283 nonn,base,easy
%O A297283 1,2
%A A297283 _Clark Kimberling_, Jan 17 2018