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.

A238224 Number of pairs {j, k} with 0 < j < k <= n and k == 1 (mod j) such that pi(j*n) divides pi(k*n), where pi(.) is given by A000720.

Table of values

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

List of values

[0, 1, 1, 2, 2, 2, 1, 3, 5, 5, 3, 3, 8, 4, 3, 5, 2, 1, 8, 2, 2, 5, 3, 4, 3, 6, 4, 6, 7, 6, 6, 4, 8, 2, 7, 5, 9, 6, 7, 5, 4, 5, 4, 8, 5, 9, 4, 5, 6, 1, 9, 2, 7, 6, 4, 9, 7, 4, 8, 6, 1, 7, 8, 10, 4, 4, 4, 8, 6, 5, 4, 7, 7, 7, 3, 9, 4, 5, 7, 9]