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.

A361511 a(1) = 1. Thereafter if a(n-1) is a novel term, a(n) = d(a(n-1)); otherwise, if a(n-1) is the t-th non-novel term, a(n) = a(n-1) + d(a(t)), where d is the divisor 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 5
10 2
11 4
12 6
13 4
14 7
15 2
16 4
17 6
18 8
19 4
20 7
21 11
22 2
23 5
24 7
25 9
26 3
27 6
28 10
29 4
30 8
31 11
32 13
33 2
34 4
35 6
36 8
37 10
38 13
39 15
40 4
41 8
42 12
43 6
44 9
45 13
46 15
47 17
48 2
49 4
50 7
51 11
52 15
53 19
54 2
55 4
56 8
57 11
58 15
59 21
60 4
61 8
62 11
63 13
64 17
65 19
66 21
67 24
68 8
69 10
70 12
71 16
72 5
73 7
74 9
75 12
76 16
77 18
78 6
79 10
80 14
81 4
82 7
83 11
84 13
85 15
86 17
87 19
88 23

List of values

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