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.

A134566 a(n) = least m such that {-m*tau} > {n*tau}, where { } denotes fractional part and tau = (1 + sqrt(5))/2.

Table of values

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

List of values

[2, 1, 5, 2, 1, 2, 1, 13, 2, 1, 5, 2, 1, 2, 1, 5, 2, 1, 2, 1, 34, 2, 1, 5, 2, 1, 2, 1, 13, 2, 1, 5, 2, 1, 2, 1, 5, 2, 1, 2, 1, 13, 2, 1, 5, 2, 1, 2, 1, 5, 2, 1, 2, 1, 89, 2, 1, 5, 2, 1, 2, 1, 13, 2, 1, 5, 2, 1, 2, 1, 5, 2, 1, 2, 1, 34, 2, 1, 5, 2, 1, 2, 1, 13, 2, 1, 5, 2, 1, 2, 1, 5, 2, 1, 2, 1, 13, 2, 1, 5, 2, 1]