A052058 Numbers k such that the largest palindromic substring (without leading zeros) of 2^k is a repdigit of minimum length 2.

16, 24, 25, 26, 27, 38, 39, 40, 42, 43, 44, 45, 46, 51, 95, 96, 108, 169, 191, 193, 198, 202, 205, 247, 250, 316, 317, 379, 386, 421, 422, 423, 425, 485, 486, 488, 589, 592, 642, 643, 659, 731, 736, 758, 759, 800, 835, 839, 927, 971, 972, 978

Offset

1,1

Links

Michael S. Branicky, Table of n, a(n) for n = 1..149 (terms 1..79 from Sean A. Irvine)

Michael S. Branicky, Python program for OEIS A052058

Example

2^44 = 175921860{444}16 and this repdigit 444 is its largest palindromic substring.

Prog

(Python) # see linked program

Crossrefs

Cf. A052059, A052057.

Sequence in context: A206267 A325480 A205193 * A105732 A339328 A337378

Adjacent sequences: A052055 A052056 A052057 * A052059 A052060 A052061

Keyword

nonn,base

Author

Patrick De Geest, Jan 15 2000

Extensions

Offset changed to 1 by Jon E. Schoenfield, Oct 17 2019

Status

approved