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.

A214793 a(n)= smallest k>=2 such that n divides Fibonacci(k-1)+13, or 0 if no such k exists.

Table of values

n a(n)
1 2
2 2
3 4
4 5
5 4
6 6
7 2
8 5
9 6
10 15
11 0
12 23
13 8
14 2
15 4
16 5
17 9
18 6
19 0
20 17
21 7
22 0
23 18
24 0
25 17
26 8
27 30
28 23
29 0
30 15
31 0
32 29
33 0
34 9
35 18
36 0
37 32
38 0
39 15
40 17
41 14
42 23
43 38
44 0
45 44
46 18
47 10
48 0
49 19
50 17
51 12
52 29
53 19

List of values

[2, 2, 4, 5, 4, 6, 2, 5, 6, 15, 0, 23, 8, 2, 4, 5, 9, 6, 0, 17, 7, 0, 18, 0, 17, 8, 30, 23, 0, 15, 0, 29, 0, 9, 18, 0, 32, 0, 15, 17, 14, 23, 38, 0, 44, 18, 10, 0, 19, 17, 12, 29, 19]