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.

A354960 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier that is a multiple of the number of proper divisors of a(n-1).

Table of values

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

List of values

[1, 2, 3, 4, 6, 9, 8, 12, 5, 7, 10, 15, 18, 20, 25, 14, 21, 24, 28, 30, 35, 27, 33, 36, 16, 32, 40, 42, 49, 22, 39, 45, 50, 55, 48, 54, 56, 63, 60, 11, 13, 17, 19, 23, 26, 51, 57, 66, 70, 77, 69, 72, 44, 65, 75, 80, 81, 52, 85, 78, 84, 88, 91, 87, 90, 99, 95, 93, 96, 110, 98, 100, 64, 102, 105, 112]