A293347 - OEIS

%I #9 Nov 13 2018 14:20:30

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

%N 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.

%H Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman, <a href="https://dx.doi.org/10.1016/j.tcs.2017.02.017">Encoding nearest larger values</a>, Theoretical Computer Science 710 (2018), 97-115.

%Y Cf. A293346, A293348.

%K nonn,more

%O 0,3

%A _Eric M. Schmidt_, Oct 07 2017