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.

A261104 a(0)=0; for n >= 1, a(n) = 1 + a(n-A070319(n)), where A070319(n) is the maximum value for A000005 (number of divisors) in range 1 .. n.

Table of values

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

List of values

[0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 6, 5, 6, 5, 6, 6, 6, 6, 7, 6, 7, 6, 7, 7, 7, 7, 7, 8, 7, 8, 7, 8, 8, 8, 8, 8, 8, 9, 8, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 9, 10, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 11, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 11, 12, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 12, 13, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 13, 14, 13, 14, 14, 14, 14, 14, 14, 14, 14]