Least k such that the longest palindromic substring (without leading zeros) contained in 2^k has length n.
A052059
Least k such that the longest palindromic substring (without leading zeros) contained in 2^k has length n.
Terms
- a(0) =0a(1) =16a(2) =17a(3) =47a(4) =49a(5) =41a(6) =146a(7) =274a(8) =76a(9) =468a(10) =1622a(11) =4381a(12) =2961a(13) =12799a(14) =4292a(15) =28493a(16) =34597a(17) =16276
External references
- oeis: A052059