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.

A112682 Triangle read by rows: T(n,k) counts the occurrences of integer k in the sequence generated by replacing integer i with the sorted sequence of divisors of (i+1), starting on 1 and iterating n times.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 9, 5, 3, 1, 1, 19, 13, 6, 3, 1, 1, 43, 26, 14, 6, 3, 1, 1, 94, 61, 29, 15, 6, 3, 1, 1, 210, 130, 68, 30, 15, 6, 3, 1, 1, 464, 297, 146, 71, 31, 15, 6, 3, 1, 1, 1035, 648, 331, 152, 72, 31, 15, 6, 3, 1, 1, 2295, 1457, 727, 347, 155, 73, 31, 15, 6, 3, 1, 1]