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.

A036459 Number of iterations required to reach stationary value when repeatedly applying d, the number of divisors function (A000005).

Table of values

n a(n)
1 0
2 0
3 1
4 2
5 1
6 3
7 1
8 3
9 2
10 3
11 1
12 4
13 1
14 3
15 3
16 2
17 1
18 4
19 1
20 4
21 3
22 3
23 1
24 4
25 2
26 3
27 3
28 4
29 1
30 4
31 1
32 4
33 3
34 3
35 3
36 3
37 1
38 3
39 3
40 4
41 1
42 4
43 1
44 4
45 4
46 3
47 1
48 4
49 2
50 4
51 3
52 4
53 1
54 4
55 3
56 4
57 3
58 3
59 1
60 5
61 1
62 3
63 4
64 2
65 3
66 4
67 1
68 4
69 3
70 4
71 1
72 5
73 1
74 3
75 4
76 4
77 3
78 4
79 1
80 4
81 2
82 3
83 1
84 5
85 3
86 3
87 3
88 4
89 1
90 5
91 3
92 4
93 3
94 3
95 3
96 5
97 1
98 4
99 4

List of values

[0, 0, 1, 2, 1, 3, 1, 3, 2, 3, 1, 4, 1, 3, 3, 2, 1, 4, 1, 4, 3, 3, 1, 4, 2, 3, 3, 4, 1, 4, 1, 4, 3, 3, 3, 3, 1, 3, 3, 4, 1, 4, 1, 4, 4, 3, 1, 4, 2, 4, 3, 4, 1, 4, 3, 4, 3, 3, 1, 5, 1, 3, 4, 2, 3, 4, 1, 4, 3, 4, 1, 5, 1, 3, 4, 4, 3, 4, 1, 4, 2, 3, 1, 5, 3, 3, 3, 4, 1, 5, 3, 4, 3, 3, 3, 5, 1, 4, 4]