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.

A099305 Number of solutions of the equation (n+k)' = n' + k', with 1 <= k <= 2n, where n' denotes the arithmetic derivative of n.

Table of values

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

List of values

[1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 3, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 2, 1, 3, 1, 3, 1, 2, 2, 2, 1, 3, 1, 3, 1, 2, 3, 3, 1, 3, 1, 2, 1, 3, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 1, 2, 1, 3, 2, 3, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 2, 2, 1, 3, 3, 3, 1, 2, 2, 3, 2]