|
%I #23 Aug 21 2020 01:43:09
%S 0,2,0,10,0,44,28,202,252,872,1364,3748,6552,15500,29040,63562,122400,
%T 257588,504868,1038520,2054416,4171796,8294444,16728580,33349800,
%U 67002392,133775964,268207012,535920696,1073250704,2145452092,4293920842,8585610704,17177640992,34350563968
%N Number of length-n binary strings such that no rotation is a palindrome.
%e For n = 4 the 10 strings are 0001, 0010, 0100, 0101, 0111 and their binary complements.
%e The 5 binary palindromes are 00000, 00100, 01010, 01110, 10001, 10101, 11011, 11111. Rotating each of them around gives 32 distinct palindromes. As there are 2^5 = 32 possible binary strings of length 5 there are 32-32 = 0 binary strings such that no rotation is a palindrome. - _David A. Corneth_, Aug 13 2020
%Y Cf. A057148.
%K nonn
%O 1,2
%A _Jeffrey Shallit_, Aug 13 2020
|
