cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Table of values

n a(n)
0 0
1 9
2 18
3 27
4 36
5 45
6 54
7 63
8 72
9 81
10 9
11 90
12 9
13 18
14 27
15 36
16 45
17 54
18 63
19 72
20 18
21 9
22 180
23 9
24 18
25 27
26 36
27 45
28 54
29 63
30 27
31 18
32 9
33 270
34 9
35 18
36 27
37 36
38 45
39 54
40 36
41 27
42 18
43 9
44 360
45 9
46 18
47 27
48 36
49 45
50 45
51 36
52 27
53 18
54 9
55 450
56 9
57 18
58 27
59 36
60 54
61 45
62 36
63 27
64 18
65 9
66 540
67 9
68 18
69 27
70 63
71 36
72 45
73 36
74 27
75 18

List of values

[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]