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.

A280738 After S(n)=A280864(n) has been computed, let p(n) = product of distinct primes shared by S(n-1) and S(n); let q(n) = product of distinct primes in S(n) but not in S(n-1); and let r(n) = smallest number not yet in S. Sequence gives p(n).

Table of values

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

List of values

[1, 1, 2, 1, 3, 2, 1, 5, 2, 3, 1, 7, 2, 1, 11, 2, 3, 5, 2, 3, 7, 2, 13, 1, 17, 2, 15, 1, 19, 2, 1, 23, 2, 3, 1, 5, 7, 6, 1, 29, 2, 5, 11, 3, 13, 2, 11, 7, 1, 31, 2, 5, 13, 6, 1, 37, 2, 7, 3, 17, 2, 15, 1, 41, 2, 1, 43, 2, 33, 1, 47, 2, 35, 3, 19, 2, 3, 23, 2, 5]