%I #15 Jan 18 2022 05:37:05
%S 0,1,1,2,2,2,1,2,3,3,3,3,3,2,1,2,3,4,4,4,4,4,3,3,4,4,4,3,3,2,1,2,3,4,
%T 4,5,5,5,4,4,5,5,5,5,5,4,3,3,4,5,5,5,5,5,4,3,4,4,4,3,3,2,1,2,3,4,4,5,
%U 5,5,4,5,6,6,6,6,6,5,4,4,5,6,6,6,6,6
%N Number of pieces in the list d(m), d(m-1), ..., d(0) of base-2 digits of n; see Comments.
%C The definition of "piece" starts with the base-b digits d(m), d(m-1), ..., d(0) of n. First, an *ascent* is a list (d(i), d(i-1), ..., d(i-h)) such that d(i) < d(i-1) < ... < d(i-h), where d(i+1) >= d(i) if i < m, and d(i-h-1) >= d(i-h) if i > h. A *descent* is a list (d(i), d(i-1), ..., d(i-h)) such that d(i) > d(i-1) > ... > d(i-h), where d(i+1) <= d(i) if i < m, and d(i-h-1) <= d(i-h) if i > h. A *flat* is a list (d(i), d(i-1), ..., d(i-h)), where h > 0, such that d(i) = d(i-1) = ... = d(i-h), where d(i+1) != d(i) if i < m, and d(i-h-1) != d(i-h) if i > h. A *piece* is an ascent, a descent, or a flat. Example: 235621103 has five pieces: (2,3,5,6), (6,2,1), (1,1), (1,0), and (0,3); that's 2 ascents, 2 descents, and 1 flat. For every b, the "piece sequence" includes every positive integer infinitely many times.
%H Clark Kimberling, <a href="/A297030/b297030.txt">Table of n, a(n) for n = 1..10000</a>
%e Base-2 digits for 100: 1, 1, 0, 0, 1, 0, 0, so that a(100) = 6.
%t a[n_, b_] := Length[Map[Length, Split[Sign[Differences[IntegerDigits[n, b]]]]]];
%t b = 2; Table[a[n, b], {n, 1, 120}]
%Y Cf. A297038, A296712 (rises and falls), A296882 (pits and peaks).
%Y Guide to related sequences:
%Y Base # pieces for n >= 1
%Y 2 A297030
%Y 3 A297031
%Y 4 A297032
%Y 5 A297033
%Y 6 A297034
%Y 7 A297035
%Y 8 A297036
%Y 9 A297037
%Y 10 A297038
%Y 11 A297039
%Y 12 A297040
%Y 13 A297041
%Y 14 A297042
%Y 15 A297043
%Y 16 A297044
%Y 20 A297045
%Y 60 A297046
%K nonn,easy,base
%O 1,4
%A _Clark Kimberling_, Jan 13 2018
|