Sum of subword complexity (number of nonempty distinct subwords) of all binary strings of length n.

Terms

a(0) =0a(1) =2a(2) =10a(3) =36a(4) =114a(5) =332a(6) =916a(7) =2428a(8) =6242a(9) =15652a(10) =38460a(11) =92916a(12) =221256a(13) =520332a(14) =1210448a(15) =2789100a(16) =6372498a(17) =14450420a(18) =32547188a(19) =72861376a(20) =162211196a(21) =359318644a(22) =792287340a(23) =1739623672a(24) =3804904316a(25) =8292351960a(26) =18012452664a(27) =39006099616a(28) =84226667004a(29) =181387693028