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.
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.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =14a(5) =42a(6) =126a(7) =383a(8) =1178a(9) =3640a(10) =11316a(11) =35263a(12) =110376
External references
- oeis: A293347