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.

A358235 Number of ways n' (the arithmetic derivative of n) can be formed as a sum (x * y') + (x' * y) from two factors x and y of n, with x <= y, so that the said sum does not involve any carries when the addition is done in the primorial base.

Table of values

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

List of values

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