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.

A060383 a(1) = a(2) = 1; for n >2, a(n) = smallest prime factor of n-th Fibonacci number.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 2
7 13
8 3
9 2
10 5
11 89
12 2
13 233
14 13
15 2
16 3
17 1597
18 2
19 37
20 3
21 2
22 89
23 28657
24 2
25 5
26 233
27 2
28 3
29 514229
30 2
31 557
32 3
33 2
34 1597
35 5
36 2
37 73
38 37
39 2
40 3
41 2789
42 2
43 433494437
44 3
45 2
46 139
47 2971215073
48 2
49 13
50 5
51 2
52 3
53 953
54 2
55 5
56 3
57 2
58 59
59 353
60 2
61 4513
62 557
63 2
64 3
65 5
66 2
67 269
68 3
69 2
70 5

List of values

[1, 1, 2, 3, 5, 2, 13, 3, 2, 5, 89, 2, 233, 13, 2, 3, 1597, 2, 37, 3, 2, 89, 28657, 2, 5, 233, 2, 3, 514229, 2, 557, 3, 2, 1597, 5, 2, 73, 37, 2, 3, 2789, 2, 433494437, 3, 2, 139, 2971215073, 2, 13, 5, 2, 3, 953, 2, 5, 3, 2, 59, 353, 2, 4513, 557, 2, 3, 5, 2, 269, 3, 2, 5]