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.

A178095 a(1)=a(2)=a(3)=1; thereafter a(n) = lpf(a(n-1)+a(n-2)+a(n-3)), where lpf = "least prime factor".

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 5
6 3
7 11
8 19
9 3
10 3
11 5
12 11
13 19
14 5
15 5
16 29
17 3
18 37
19 3
20 43
21 83
22 3
23 3
24 89
25 5
26 97
27 191
28 293
29 7
30 491
31 7
32 5
33 503
34 5
35 3
36 7
37 3
38 13
39 23
40 3
41 3
42 29
43 5
44 37
45 71
46 113
47 13
48 197
49 17
50 227
51 3
52 13
53 3
54 19
55 5
56 3
57 3
58 11
59 17
60 31
61 59
62 107
63 197
64 3
65 307
66 3
67 313
68 7
69 17
70 337
71 19
72 373
73 3
74 5
75 3
76 11
77 19
78 3
79 3
80 5
81 11
82 19
83 5
84 5
85 29
86 3
87 37
88 3
89 43
90 83
91 3
92 3
93 89
94 5
95 97
96 191
97 293
98 7
99 491
100 7

List of values

[1, 1, 1, 3, 5, 3, 11, 19, 3, 3, 5, 11, 19, 5, 5, 29, 3, 37, 3, 43, 83, 3, 3, 89, 5, 97, 191, 293, 7, 491, 7, 5, 503, 5, 3, 7, 3, 13, 23, 3, 3, 29, 5, 37, 71, 113, 13, 197, 17, 227, 3, 13, 3, 19, 5, 3, 3, 11, 17, 31, 59, 107, 197, 3, 307, 3, 313, 7, 17, 337, 19, 373, 3, 5, 3, 11, 19, 3, 3, 5, 11, 19, 5, 5, 29, 3, 37, 3, 43, 83, 3, 3, 89, 5, 97, 191, 293, 7, 491, 7]