id:A052036 - OEIS Search Results

Search: id:A052036

Displaying 1-1 of 1 results found.

page 1

A052036

Smallest number that must be added to n to make or keep n palindromic.

+0
3

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 (list; graph; listen)

	OFFSET	`0,13`
	LINKS	`P. De Geest, World!Of Numbers`
	EXAMPLE	`If n = 13 we need to add 9 to arrive at palindrome 22.`
	CROSSREFS	`Cf. A052037.` `Sequence in context: A081101 A022966 A023452 this_sequence A143473 A055121 A132674` `Adjacent sequences: A052033 A052034 A052035 this_sequence A052037 A052038 A052039`
	KEYWORD	`nonn,base,easy`
	AUTHOR	`Patrick De Geest (pdg(AT)worldofnumbers.com), Dec 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research