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.

A364236 a(1) = 1. For n > 1, if a(n-1) is a novel term, a(n) = d(a(n-1)), else if a(n-1) is a repeat term seen k (>1) times, a(n) = a(n-1) + d(k-1), where d is the divisor counting function A000005.

Table of values

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

List of values

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