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.

A363533 Least k such that n*F(k)+1 is prime, where F = A000045 is the Fibonacci sequence, or -1 if no such k exists.

Table of values

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

List of values

[1, 1, 3, 1, 3, 1, 9, 3, 3, 1, 3, 1, 9, 3, 3, 1, 6, 1, 9, 3, 3, 1, 3, 4, 18, 3, 9, 1, 3, 1, 15, 4, 3, 4, 3, 1, 9, 5, 3, 1, 3, 1, 48, 3, 9, 1, 24, 3, 9, 3, 3, 1, 3, 3, 9, 3, 6, 1, 24, 1, 36, 5, 3, 4, 3, 1, 12, 3, 3, 1, 6, 1, 12, 3, 3, 4, 6, 1, 9, 4, 3, 1, 3, 5]