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.

A093321 a(1) = 1; for m >= 2, a(m) =sum_{primes p which do not divide m} a(pi(p)), where pi(p) is the order of p among the primes = the number of primes <= p.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 2
8 1
9 2
10 0
11 2
12 2
13 3
14 3
15 3
16 3
17 4
18 5
19 6
20 5
21 7
22 5
23 7
24 8
25 8
26 7
27 9
28 8
29 9
30 7
31 9
32 10
33 10
34 8
35 10
36 10
37 11
38 11
39 12
40 11
41 13
42 15
43 16
44 17
45 18
46 16
47 19
48 21
49 22
50 20
51 20
52 20
53 22
54 24
55 23
56 24
57 24
58 24
59 25
60 27
61 29
62 31
63 34
64 33
65 32
66 32
67 34
68 37
69 38
70 38
71 40
72 44
73 45
74 49
75 51
76 50
77 51
78 50
79 52
80 55

List of values

[1, 0, 1, 0, 1, 1, 2, 1, 2, 0, 2, 2, 3, 3, 3, 3, 4, 5, 6, 5, 7, 5, 7, 8, 8, 7, 9, 8, 9, 7, 9, 10, 10, 8, 10, 10, 11, 11, 12, 11, 13, 15, 16, 17, 18, 16, 19, 21, 22, 20, 20, 20, 22, 24, 23, 24, 24, 24, 25, 27, 29, 31, 34, 33, 32, 32, 34, 37, 38, 38, 40, 44, 45, 49, 51, 50, 51, 50, 52, 55]