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.

A254032 a(0)=0, a(1)=1; for n > 2, a(n) is the smallest prime factor of a(n-1) + a(n-2) not already in the sequence or, if there is no such prime, a(n) = 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 49
18 79
19 128
20 23
21 151
22 29
23 180
24 209
25 389
26 598
27 987
28 317
29 163
30 480
31 643
32 1123
33 883
34 17
35 900
36 131
37 1031
38 83
39 557
40 640
41 1197
42 167
43 31
44 198
45 229
46 61
47 290
48 351
49 641
50 992
51 71
52 1063
53 1134
54 2197
55 3331
56 691

List of values

[0, 1, 1, 2, 3, 5, 8, 13, 7, 20, 27, 47, 37, 84, 11, 19, 30, 49, 79, 128, 23, 151, 29, 180, 209, 389, 598, 987, 317, 163, 480, 643, 1123, 883, 17, 900, 131, 1031, 83, 557, 640, 1197, 167, 31, 198, 229, 61, 290, 351, 641, 992, 71, 1063, 1134, 2197, 3331, 691]