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.
A293348
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.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =12a(5) =32a(6) =88a(7) =248a(8) =702a(9) =1998a(10) =5696a(11) =16304a(12) =46718
External references
- oeis: A293348