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.

A361503 a(1)=2; thereafter a(n) = smallest prime that does not divide b(n-1)*b(n), where b(k) = A359804(k).

Table of values

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

List of values

[2, 3, 5, 2, 3, 5, 7, 3, 2, 5, 7, 11, 3, 5, 7, 11, 5, 3, 7, 5, 11, 7, 2, 3, 5, 7, 11, 5, 7, 2, 3, 5, 7, 3, 5, 7, 2, 5, 7, 11, 13, 5, 2, 3, 5, 2, 7, 3, 5, 7, 11, 5, 3, 2, 5, 7, 11, 2, 5, 3, 7, 5, 3, 7, 2, 11, 3, 7, 5, 3, 7, 5, 11, 7, 5, 11, 7, 5, 3, 7, 11, 3, 2, 5, 7, 2, 5, 3, 2, 5, 7, 13, 3, 5, 2, 3]