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.

A277327 Number of distinct primes dividing gcd(A260443(n), A260443(n+1)): a(n) = A001221(A277198(n)).

Table of values

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

List of values

[0, 0, 1, 0, 0, 1, 2, 0, 0, 2, 2, 1, 1, 2, 3, 0, 0, 3, 2, 1, 1, 2, 3, 1, 1, 3, 3, 2, 2, 3, 4, 0, 0, 4, 3, 2, 2, 3, 3, 1, 1, 3, 3, 2, 2, 3, 4, 1, 1, 4, 3, 2, 2, 3, 4, 2, 2, 4, 4, 3, 3, 4, 5, 0, 0, 5, 4, 3, 3, 4, 4, 2, 2, 4, 3, 2, 2, 3, 4, 1, 1, 4, 3, 2, 2, 3, 4, 2, 2, 4, 4, 3, 3, 4, 5, 1, 1, 5, 4, 3, 3, 4, 4, 2, 2, 4, 4, 3, 3, 4, 5, 2, 2, 5, 4, 3, 3, 4, 5, 3, 3]