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.

A361509 a(n) = smallest Fibonacci number F(k) such that F(k) + F(n) is a prime, or -1 if no such F(k) exists.

Table of values

n a(n)
0 2
1 1
2 1
3 0
4 0
5 0
6 3
7 0
8 2
9 3
10 34
11 0
12 5
13 0
14 2
15 3
16 34
17 0
18 987
19 46368
20 2584
21 3
22 2
23 0
24 13
25 144

List of values

[2, 1, 1, 0, 0, 0, 3, 0, 2, 3, 34, 0, 5, 0, 2, 3, 34, 0, 987, 46368, 2584, 3, 2, 0, 13, 144]