login
a(n) is the least k such that 2^k contains a palindromic substring of length n.
1

%I #2 Mar 30 2012 17:40:36

%S 0,16,17,41,43,41,76,274,76,468

%N a(n) is the least k such that 2^k contains a palindromic substring of length n.

%e a(6)=41 since the first palindromic substring of length 6

%e appears in 2^41=2199023(255552).

%Y Cf. A115943.

%K nonn,base

%O 1,2

%A _Giovanni Resta_, Feb 06 2006