|
|
A052484
|
|
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 from n (a(n)=0 if no such q exists).
|
|
2
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Quasi-periodic.
|
|
LINKS
|
|
|
EXAMPLE
|
a(1)=9 since P={1,10,100,...} and 10-1 = 9.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|