A293347 Number of distinguishable configurations of the nearest larger value problem on an array of size n, using tiebreaking rule II: ties are broken by using the smaller value.

1, 1, 2, 5, 14, 42, 126, 383, 1178, 3640, 11316, 35263, 110376

Offset

0,3

Links

Table of n, a(n) for n=0..12.

Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman, Encoding nearest larger values, Theoretical Computer Science 710 (2018), 97-115.

Crossrefs

Cf. A293346, A293348.

Sequence in context: A298367 A025274 A132833 * A148326 A148327 A092493

Adjacent sequences: A293344 A293345 A293346 * A293348 A293349 A293350

Keyword

nonn,more

Author

Eric M. Schmidt, Oct 07 2017

Status

approved