|
%I #17 Dec 30 2015 14:43:23
%S 2,2,6,10,26,38,104,162,394,684,1584,2798,6350,11524,25320,47348,
%T 101728,193244,409650,788018,1649198,3207640,6648872,13030392,
%U 26821720,52867234,108207760,214252886,436604050,867366654,1761592316,3508334870,7106441568,14179665756
%N Number of binary strings of length n that cannot be written as the concatenation of nontrivial powers of other strings.
%F a(n) = 2^n - A265642(n). - _Altug Alkan_, Dec 20 2015
%e For n = 4 there are 16 strings of length 4, of which 4 are powers: 0000, 1111, 0101, 1010, and 2 are the products of two powers: 0011, 1100. So a(4) = 10.
%Y Cf. A265642.
%K nonn,base
%O 1,1
%A _Jeffrey Shallit_, Dec 11 2015
%E a(17)-a(34) from _Lars Blomberg_, Dec 20 2015
|
