a(n) = 2^m minus (the total number of distinct subsets of length-(m-n) binary words that can appear as the factor of a word of length m, for 0 <= n < m/2).
A225865
a(n) = 2^m minus (the total number of distinct subsets of length-(m-n) binary words that can appear as the factor of a word of length m, for 0 <= n < m/2).
Terms
- a(0) =0a(1) =1a(2) =5a(3) =14a(4) =38a(5) =83a(6) =191a(7) =401a(8) =849a(9) =1740a(10) =3600a(11) =7285a(12) =14845a(13) =29938a(14) =60486a(15) =121686a(16) =245046a(17) =492090a(18) =988782a(19) =1983945a(20) =3981105a(21) =7982802a(22) =16006686a(23) =32080696a(24) =64292920a(25) =128812795a(26) =258059003a(27) =516891668a(28) =1035249788a(29) =2073167531
External references
- oeis: A225865