|
%I #14 Nov 13 2018 14:20:20
%S 1,1,2,5,14,40,116,341,1010,3009,9012,27087,81658,246841,747728,
%T 2269137,6897656,20996048,63988866,195237052,596265104,1822623729,
%U 5575826696,17069972962,52292860854,160295112707,491629937802,1508617457047,4631590611528,14225646628664
%N 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.
%C The terms can be computed using the formulas in Section 7 of [Hoffman et al.], which denotes this sequence as gamma_n.
%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. A293347, A293348.
%K nonn
%O 0,3
%A _Eric M. Schmidt_, Oct 07 2017
|
