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.

A206713 Number of solutions (n,k) of s(k)=s(n) (mod n), where 1<=k and s(k)=A000045(k+1) (Fibonacci numbers).

Table of values

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

List of values

[0, 0, 1, 1, 1, 0, 1, 1, 0, 3, 2, 1, 1, 0, 1, 1, 1, 3, 0, 1, 3, 0, 2, 1, 1, 1, 2, 6, 0, 3, 5, 0, 2, 0, 4, 1, 4, 1, 2, 4, 3, 0, 1, 2, 2, 2, 5, 2, 0, 1, 2, 1, 1, 2, 2, 0, 5, 3, 2, 4, 4, 2, 2, 1, 4, 0, 3, 1, 1, 3, 8, 1, 1, 0, 8, 1, 2, 3, 2, 3, 3, 0, 6, 1, 1, 3, 6, 8, 1, 0, 3, 3, 6, 0, 5, 1, 0, 1, 1]