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.
A293346
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.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =14a(5) =40a(6) =116a(7) =341a(8) =1010a(9) =3009a(10) =9012a(11) =27087a(12) =81658a(13) =246841a(14) =747728a(15) =2269137a(16) =6897656a(17) =20996048a(18) =63988866a(19) =195237052a(20) =596265104a(21) =1822623729a(22) =5575826696a(23) =17069972962a(24) =52292860854a(25) =160295112707a(26) =491629937802
External references
- oeis: A293346