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.

A360179 a(1) = 1. Thereafter if a(n-1) is a novel term, a(n) = d(a(n-1)); otherwise a(n) = a(n-1) + d(u), where d is the divisor function A000005 and u is the smallest unstarred prior term (each time we use a prior term we star it, and starred terms cannot be reused).

Table of values

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

List of values

[1, 1, 2, 2, 3, 2, 4, 3, 5, 2, 4, 6, 4, 6, 8, 4, 7, 2, 5, 7, 10, 4, 7, 10, 12, 6, 8, 12, 16, 5, 9, 3, 5, 7, 9, 11, 2, 4, 6, 9, 13, 2, 4, 6, 9, 13, 15, 4, 8, 11, 15, 19, 2, 5, 7, 9, 11, 14, 4, 7, 10, 12, 15, 18, 6, 10, 14, 18, 22, 4, 8, 11]