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.

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

Table of values

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

List of values

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