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.

A235715 a(n) = number of times (n-1) occurs in the fundamental period of Fibonacci numbers modulo n.

Table of values

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

List of values

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