id:A060382 - OEIS Search Results

Search: id:A060382

Displaying 1-1 of 1 results found.

page 1

In base n, a(n) is the smallest number m that leads to a palindrome-free sequence, using the following process: start with m; reverse the digits and add it to m, repeat. Stop if you reach a palindrome.

+0
1

22, 100, 255, 708, 1079, 2656, 1021, 593, 196, 1011, 237, 2196, 361, 447, 413, 3297, 519, 341, 379, 711, 461, 505, 551, 1022, 649, 701, 755, 811, 869, 929, 991, 1055, 1799, 1922, 1259, 1331, 1405, 1481, 1559, 1639, 1595, 1762, 1891, 1934, 2069, 2161 (list; graph; listen)

	OFFSET	`2,1`
	LINKS	`Karl Hovekamp (karl.hovekamp(AT)web.de), Jan 03 2007, Table of n, a(n) for n = 2..3428` `K. S. Brown, Digit Reversal Sums Leading to Palindromes` `Author?, 196 problem.`
	CROSSREFS	`Sequence in context: A145769 A159539 A026909 this_sequence A044273 A044654 A156795` `Adjacent sequences: A060379 A060380 A060381 this_sequence A060383 A060384 A060385`
	KEYWORD	`nonn`
	AUTHOR	`Michel ten Voorde (seqfan(AT)tenvoorde.org) Apr 03 2001`
	EXTENSIONS	`More terms from Karl Hovekamp (karl.hovekamp(AT)web.de), Jan 03 2007`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research