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.

A280740 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 r(n).

Table of values

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

List of values

[2, 3, 3, 5, 5, 5, 7, 7, 7, 7, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 17, 19, 19, 19, 19, 23, 23, 23, 25, 25, 25, 25, 29, 29, 29, 29, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 37, 37, 41, 41, 41, 41, 41, 41, 41, 41, 43, 43, 43, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]