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.

A117339 a(n) = a(n-1) + a(n-2); if a(n) is not prime divide a(n) by its largest prime factor.

Table of values

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

List of values

[1, 1, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2]