A293346 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A293346

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

1, 1, 2, 5, 14, 40, 116, 341, 1010, 3009, 9012, 27087, 81658, 246841, 747728, 2269137, 6897656, 20996048, 63988866, 195237052, 596265104, 1822623729, 5575826696, 17069972962, 52292860854, 160295112707, 491629937802, 1508617457047, 4631590611528, 14225646628664

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

The terms can be computed using the formulas in Section 7 of [Hoffman et al.], which denotes this sequence as gamma_n.

LINKS

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

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

CROSSREFS

Cf. A293347, A293348.

Sequence in context: A052963 A329275 A036908 * A273900 A126220 A136304

Adjacent sequences: A293343 A293344 A293345 * A293347 A293348 A293349

KEYWORD

nonn

AUTHOR

Eric M. Schmidt, Oct 07 2017

STATUS

approved