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.

A128555 a(n) = the smallest positive multiple of d(n) that does not occur earlier in the sequence, where d(n) is the number of positive divisors of n.

Table of values

n a(n)
1 1
2 2
3 4
4 3
5 6
6 8
7 10
8 12
9 9
10 16
11 14
12 18
13 20
14 24
15 28
16 5
17 22
18 30
19 26
20 36
21 32
22 40
23 34
24 48
25 15
26 44
27 52
28 42
29 38
30 56
31 46
32 54
33 60
34 64
35 68
36 27
37 50
38 72
39 76
40 80
41 58
42 88
43 62
44 66
45 78
46 84
47 70
48 90
49 21
50 96
51 92
52 102
53 74
54 104
55 100
56 112
57 108
58 116
59 82
60 120
61 86
62 124
63 114
64 7
65 128
66 136
67 94
68 126

List of values

[1, 2, 4, 3, 6, 8, 10, 12, 9, 16, 14, 18, 20, 24, 28, 5, 22, 30, 26, 36, 32, 40, 34, 48, 15, 44, 52, 42, 38, 56, 46, 54, 60, 64, 68, 27, 50, 72, 76, 80, 58, 88, 62, 66, 78, 84, 70, 90, 21, 96, 92, 102, 74, 104, 100, 112, 108, 116, 82, 120, 86, 124, 114, 7, 128, 136, 94, 126]