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.

A082284 a(n) = smallest number k such that k - tau(k) = n, or 0 if no such number exists, where tau(n) = the number of divisors of n (A000005).

Table of values

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

List of values

[1, 3, 6, 5, 8, 7, 9, 0, 0, 11, 14, 13, 18, 0, 20, 17, 24, 19, 22, 0, 0, 23, 25, 27, 0, 0, 32, 29, 0, 31, 34, 35, 40, 0, 38, 37, 0, 0, 44, 41, 0, 43, 46, 0, 50, 47, 49, 51, 56, 0, 0, 53, 0, 57, 58, 0, 0, 59, 62, 61, 72, 65, 68, 0, 0, 67, 0, 0, 0, 71, 74, 73, 84, 77, 0, 0, 81, 79, 82, 0, 88]