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.

A089808 a(n) = floor(1/((n*r) mod 1)), where r = phi^(-2) = (3 - sqrt(5))/2.

Table of values

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

List of values

[2, 1, 6, 1, 1, 3, 1, 17, 2, 1, 4, 1, 1, 2, 1, 8, 2, 1, 3, 1, 46, 2, 1, 5, 1, 1, 3, 1, 12, 2, 1, 4, 1, 1, 2, 1, 7, 1, 1, 3, 1, 23, 2, 1, 5, 1, 1, 2, 1, 10, 2, 1, 4, 1, 122, 2, 1, 6, 1, 1, 3, 1, 15, 2, 1, 4, 1, 1, 2, 1, 8, 1, 1, 3, 1, 33, 2, 1, 5, 1, 1, 3, 1, 11, 2, 1, 4, 1, 1, 2, 1, 7, 1, 1, 3, 1, 19, 2, 1, 5, 1]