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.

A330080 a(n) = floor(b(n)), where b(1) = b(2) = b(3) = 1 and b(n) = (b(n-1) + b(n-2))/b(n-3) for n > 3.

Table of values

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

List of values

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