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.

A093320 a(1) = 1; for m >= 2, a(m) = sum{p|m} a(pi(p)), where the sum is over the distinct prime divisors p of m and pi(p) is the order of p among the primes = the number of primes <= p.

Table of values

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

List of values

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