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.

A167866 Length of the longest partition of n into distinct parts greater than 1, with each part divisible by the next one.

Table of values

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

List of values

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