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.

A214094 a(0)=0, a(1)=1; a(n)=a(n-1)+a(n-2) if a(n-1)+a(n-2) is not semiprime; otherwise a(n) is the largest prime divisor of a(n-1)+a(n-2).

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 3
5 5
6 8
7 13
8 7
9 20
10 27
11 47
12 37
13 84
14 11
15 19
16 30
17 7
18 37
19 44
20 81
21 125
22 103
23 228
24 331
25 43
26 374
27 139
28 513
29 652
30 233
31 885
32 1118
33 2003
34 3121
35 5124
36 8245
37 461
38 8706
39 103
40 383
41 486
42 79
43 113
44 192
45 61
46 23
47 84
48 107
49 191
50 149
51 340
52 163
53 503
54 666
55 167
56 833
57 1000
58 1833
59 2833
60 2333
61 5166
62 7499

List of values

[0, 1, 1, 2, 3, 5, 8, 13, 7, 20, 27, 47, 37, 84, 11, 19, 30, 7, 37, 44, 81, 125, 103, 228, 331, 43, 374, 139, 513, 652, 233, 885, 1118, 2003, 3121, 5124, 8245, 461, 8706, 103, 383, 486, 79, 113, 192, 61, 23, 84, 107, 191, 149, 340, 163, 503, 666, 167, 833, 1000, 1833, 2833, 2333, 5166, 7499]