|
%I #8 Dec 14 2018 09:01:29
%S 1,1,2,5,12,32,88,248,702,1998,5696,16304,46718
%N Number of distinguishable configurations of the nearest larger value problem on an array of size n, using tiebreaking rule III: ties are broken by using the larger 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, A293347.
%K nonn,more
%O 1,3
%A _Eric M. Schmidt_, Oct 07 2017
|
