id:A052058 - OEIS Search Results

Search: id:A052058

Displaying 1-1 of 1 results found.

page 1

A052058

Largest palindromic substring (without leading zeros) of 2^n is a repdigit of minimum length 2.

+0
3

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 (list; graph; listen)

	OFFSET	`0,1`
	EXAMPLE	`E.g. 2^44 = 175921860{444}16 and this repunit 444 is its largest palindromic substring.`
	CROSSREFS	`Cf. A052059, A052057.` `Sequence in context: A166675 A114405 A098351 this_sequence A105732 A166319 A114415` `Adjacent sequences: A052055 A052056 A052057 this_sequence A052059 A052060 A052061`
	KEYWORD	`nonn,base`
	AUTHOR	`Patrick De Geest (pdg(AT)worldofnumbers.com), Jan 15 2000.`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research