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.

A339082 a(n) is the number m such that F(prime(m)) is the greatest prime Fibonacci divisor of F(n)^2 + 1 where F(n) is the n-th Fibonacci number, or 0 if no such prime factor exists.

Table of values

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

List of values

[2, 2, 3, 3, 4, 4, 3, 4, 5, 5, 6, 6, 5, 6, 7, 7, 3, 7, 7, 4, 9, 9, 4, 9, 9, 3, 10, 10, 2, 10, 10, 5, 4, 5, 5, 4, 6, 6, 0, 6, 14, 14, 3, 14, 15, 15, 4, 15, 15, 7, 4, 7, 7, 5, 2, 5, 5, 2, 2, 0, 4, 4, 6, 6, 4, 6, 9, 9, 0, 9, 9, 0, 3, 3, 5, 5, 3, 5, 5, 2, 23, 23, 7]