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.

A182167 Min( f(n), n-f(n) ), where f(n) = A002708(n) = Fibonacci(n) mod n.

Table of values

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

List of values

[0, 1, 1, 1, 0, 2, 1, 3, 2, 5, 1, 0, 1, 1, 5, 5, 1, 8, 1, 5, 5, 1, 1, 0, 0, 1, 7, 11, 1, 10, 1, 5, 13, 1, 5, 0, 1, 1, 2, 5, 1, 8, 1, 19, 20, 1, 1, 0, 13, 25, 19, 23, 1, 8, 5, 21, 17, 1, 1, 0, 1, 1, 20, 5, 5, 14, 1, 3, 25, 15, 1, 0, 1, 1, 25, 3, 2, 34, 1, 5, 7]