id:A023109 - OEIS Search Results

Search: id:A023109

Displaying 1-1 of 1 results found.

page 1

Smallest number which requires exactly n iterations of Reverse and Add to reach a palindrome.

+0
24

0, 10, 19, 59, 69, 166, 79, 188, 193, 1397, 829, 167, 2069, 1797, 849, 177, 1496, 739, 1798, 10777, 6999, 1297, 869, 187, 89, 10797, 10853, 10921, 10971, 13297, 10548, 13293, 17793, 20889, 700269, 106977, 108933, 80359, 13697, 10794, 15891 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Jason Doucette, World Records` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.` `Index entries for sequences related to Reverse and Add!`
	CROSSREFS	`Cf. A033665, A006960.` `Sequence in context: A082659 A088409 A065198 this_sequence A033866 A146091 A007811` `Adjacent sequences: A023106 A023107 A023108 this_sequence A023110 A023111 A023112`
	KEYWORD	`nonn,base,nice`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.

AT&T Labs Research