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.

A118965 Number of missing residues in Fibonacci sequence mod n.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 4, 1, 4, 0, 0, 5, 4, 7, 7, 0, 12, 8, 4, 11, 0, 8, 0, 7, 19, 0, 12, 11, 14, 21, 0, 21, 8, 25, 14, 10, 22, 24, 10, 24, 0, 25, 32, 33, 12, 0, 16, 22, 16, 25, 43, 31, 24, 38, 22, 5, 36, 41, 40, 22, 20, 28, 16, 48, 40, 0, 27, 57]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.