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.

A226770 Let n+1 have proper divisors 1 < d_1,...,d_k < n+1; consider all proper divisors of n+d_1,...,n+d_k which did not appear earlier. Let them be d_{1,1}, d_{1,2},..., d_{k,1}, d_{k,2},..., d_{k,t}; then consider proper divisors of n+d_{1,1},...,n+d_{k,t} which did not appear earlier, repeat until no new divisor is introduced. a(n) is the total number of different divisors obtained.

Table of values

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

List of values

[0, 0, 1, 0, 3, 0, 5, 1, 5, 0, 9, 0, 11, 2, 3, 0, 15, 0, 17, 3, 11, 0, 21, 1, 19, 5, 17, 0, 27, 0, 29, 7, 19, 4, 23, 0, 35, 8, 23, 0, 39, 0, 41, 6, 23, 0, 45, 3, 41, 2, 31, 0, 51, 3, 39, 9, 35, 0, 57, 0, 59, 12, 29, 11, 47, 0, 65, 14, 43, 0, 69, 0, 71, 12, 39]