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.

A387103 For any n >= 2, a(n) is the number of positive values k < A386482(n-1) missing from the first n-1 terms of A386482 such that gcd(k, A386482(n-1)) != 1.

Table of values

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

List of values

[0, 0, 0, 1, 0, 0, 2, 2, 0, 1, 0, 2, 2, 0, 2, 1, 0, 0, 5, 3, 3, 1, 1, 0, 1, 0, 2, 2, 0, 1, 0, 6, 10, 8, 7, 6, 4, 2, 3, 1, 0, 1, 1, 0, 2, 4, 2, 1, 0, 1, 1, 0, 3, 3, 1, 1, 0, 8, 16, 11, 9, 11, 7, 7, 6, 3, 3, 2, 1, 0, 1, 1, 0, 0, 1, 0, 17, 31, 22, 20, 28, 24, 16]