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.

A038571 Number of times n must be differentiated to reach 0.

Table of values

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

List of values

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