A297046 Number of pieces in the list d(m), d(m-1), ..., d(0) of base-60 digits of n; see Comments.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset

1

Comments

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. See A297030 for a guide to related sequences.

Links

Clark Kimberling, Table of n, a(n) for n = 1..10000

Example

Base-60 digits for 19^7:  1, 8, 58, 17, 42, 19, so that a(19^7) = 4.

Mathematica

a[n_, b_] := Length[Map[Length, Split[Sign[Differences[IntegerDigits[n, b]]]]]];
b = 60; Table[a[n, b], {n, 1, 1000}]

Crossrefs

Cf. A297030 (pieces), A296712 (rises and falls), A296882 (pits and peaks).

Sequence in context: A000004 * A248805 A307721 A023976 A025469 A025466

Adjacent sequences: A297043 A297044 A297045 * A297047 A297048 A297049

Keyword

nonn,easy,base

Author

Clark Kimberling, Jan 13 2018

Status

approved