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.

A050141 a(n) = 2*floor((n+1)*phi) - 2*floor(n*phi) - 1 where phi = (1 + sqrt(5))/2 is the golden ratio.

Table of values

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

List of values

[3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3]