c(i,j) is cost of evaluation of edit distance of two strings with lengths i and j, when you use recursion (every call has a unit cost, other computations are free); sequence gives c(n,n).
A027618
c(i,j) is cost of evaluation of edit distance of two strings with lengths i and j, when you use recursion (every call has a unit cost, other computations are free); sequence gives c(n,n).
Terms
- a(0) =1a(1) =4a(2) =19a(3) =94a(4) =481a(5) =2524a(6) =13483a(7) =72958a(8) =398593a(9) =2193844a(10) =12146179a(11) =67570078a(12) =377393953a(13) =2114900428a(14) =11885772379a(15) =66963572734a(16) =378082854913
External references
- oeis: A027618