id:A052484 - OEIS Search Results

Search: id:A052484

Displaying 1-1 of 1 results found.

page 1

Let P = all numbers that can be obtained by permuting the digits of n and possibly adding or omitting zeros; a(n) = |n-q| where q in P is the closest number to n different different from n (a(n)=0 if no such q exists).

+0
3

0, 9, 18, 27, 36, 45, 54, 63, 72, 81, 9, 90, 9, 18, 27, 36, 45, 54, 63, 72, 18, 9, 180, 9, 18, 27, 36, 45, 54, 63, 27, 18, 9, 270, 9, 18, 27, 36, 45, 54, 36, 27, 18, 9, 360, 9, 18, 27, 36, 45, 45, 36, 27, 18, 9, 450, 9, 18, 27, 36, 54, 45, 36, 27, 18, 9, 540, 9, 18, 27, 63, 36, 45, 36, 27, 18 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Quasi-periodic.`
	EXAMPLE	`a(1)=9 since P={1,10,100,...} and 10-1 = 9.`
	CROSSREFS	`Cf. A052500, A052999.` `Sequence in context: A108782 A114386 A044894 this_sequence A072830 A008591 A070279` `Adjacent sequences: A052481 A052482 A052483 this_sequence A052485 A052486 A052487`
	KEYWORD	`nonn,base,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Mar 18 2000`
	EXTENSIONS	`More terms from Asher Natan Auel (auela(AT)reed.edu), May 12, 2000`

page 1

Search completed in 0.197 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research