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.

A140644 a(0)=1. a(n) = a(n-1)/d(n) if d(n) divides a(n-1). Otherwise, a(n) = a(n-1)*d(n). (d(n) is the number of positive divisors of n.).

Table of values

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

List of values

[1, 1, 2, 1, 3, 6, 24, 12, 3, 1, 4, 2, 12, 6, 24, 6, 30, 15, 90, 45, 270, 1080, 270, 135, 1080, 360, 90, 360, 60, 30, 240, 120, 20, 5, 20, 5, 45, 90, 360, 90, 720, 360, 45, 90, 15, 90, 360, 180, 18, 6, 1, 4, 24, 12, 96, 24, 3, 12, 3, 6, 72, 36, 9, 54, 378, 1512, 189, 378, 63]