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.

A120614 a(n) = g(n+1) - g(n) where g(k) = floor(phi*floor(k/phi)) and phi = (1+sqrt(5))/2.

Table of values

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

List of values

[1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0]