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.

A116515 a(n) = the period of the Fibonacci numbers modulo p divided by the smallest m such that p divides Fibonacci(m), where p is the n-th prime.

Table of values

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

List of values

[1, 2, 4, 2, 1, 4, 4, 1, 2, 1, 1, 4, 2, 2, 2, 4, 1, 4, 2, 1, 4, 1, 2, 4, 4, 1, 2, 2, 4, 4, 2, 1, 4, 1, 4, 1, 4, 2, 2, 4, 1, 1, 1, 4, 4, 1, 1, 2, 2, 1, 4, 1, 2, 1, 4, 2, 4, 1, 4, 2, 2, 4, 2, 1, 4, 4, 1, 4, 2, 1, 4, 1, 2, 4, 1, 2, 4, 4, 2, 2, 1, 4, 1, 4, 1, 2, 2, 4, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 4, 2, 2, 1]