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.

A113193 Number of times that Lucas(n)-Lucas(i) is prime for i=0..n-3.

Table of values

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

List of values

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