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.

A335568 a(n) is the number m such that F(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 3
2 3
3 5
4 5
5 7
6 7
7 5
8 7
9 11
10 11
11 13
12 13
13 11
14 13
15 17
16 17
17 5
18 17
19 17
20 7
21 23
22 23
23 7
24 23
25 23
26 5
27 29
28 29
29 3
30 29
31 29
32 11
33 7
34 11
35 11
36 7
37 13
38 13
39 0
40 13
41 43
42 43
43 5
44 43
45 47
46 47
47 7
48 47
49 47
50 17
51 7
52 17
53 17
54 11
55 3
56 11
57 11
58 3
59 3
60 0
61 7
62 7
63 13
64 13
65 7
66 13
67 23
68 23
69 0
70 23
71 23
72 0
73 5

List of values

[3, 3, 5, 5, 7, 7, 5, 7, 11, 11, 13, 13, 11, 13, 17, 17, 5, 17, 17, 7, 23, 23, 7, 23, 23, 5, 29, 29, 3, 29, 29, 11, 7, 11, 11, 7, 13, 13, 0, 13, 43, 43, 5, 43, 47, 47, 7, 47, 47, 17, 7, 17, 17, 11, 3, 11, 11, 3, 3, 0, 7, 7, 13, 13, 7, 13, 23, 23, 0, 23, 23, 0, 5]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.