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.

A066708 Least m such that n = m mod tau(m) if such m exists, otherwise 0.

Table of values

n a(n)
1 3
2 6
3 15
4 28
5 165
6 30
7 135
8 48
9 144
10 192
11 1755
12 300
13 1485
14 270
15 2079
16 336
17 6237
18 1008
19 9639
20 1728
21 1296
22 3510
23 28215
24 1080
25 16900
26 2970
27 10395
28 7840
29 12285
30 4158
31 41055
32 4752
33 40425
34 12474
35 48195
36 3780
37 220077
38 19278
39 51975
40 10920
41 356265
42 9450

List of values

[3, 6, 15, 28, 165, 30, 135, 48, 144, 192, 1755, 300, 1485, 270, 2079, 336, 6237, 1008, 9639, 1728, 1296, 3510, 28215, 1080, 16900, 2970, 10395, 7840, 12285, 4158, 41055, 4752, 40425, 12474, 48195, 3780, 220077, 19278, 51975, 10920, 356265, 9450]