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.

A086267 a(n) = 3 + (H(n) mod 6) + floor(r) where H()=A005185() and r = (H(n) - 2*H(n+1) + H(n+2) - 4) / H(n).

Table of values

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

List of values

[1, 0, 2, 5, 4, 5, 7, 7, 2, 2, 2, 4, 4, 4, 6, 5, 6, 7, 7, 2, 2, 3, 2, 6, 4, 4, 6, 6, 7, 6, 4, 7, 7, 4, 5, 3, 4, 6, 5, 6, 7, 7, 2, 2, 2, 3, 2, 5, 3, 3, 2, 7, 4, 2, 3, 6, 5, 2, 4, 4, 5, 4, 7, 6, 3, 4, 8, 5, 5, 7, 3, 4, 6, 5, 7, 5, 2, 6, 7, 3, 4, 3, 3, 6, 4, 5, 7, 7, 6, 2, 2, 2, 2, 3, 2, 7, 7, 6, 2, 5, 2, 2, 3, 4, 3]