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.

A223487 Number of missing residues in Lucas sequence mod n.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 0, 2, 0, 2, 4, 2, 1, 0, 8, 5, 1, 7, 7, 10, 8, 8, 4, 10, 13, 2, 0, 8, 19, 16, 12, 10, 16, 14, 22, 21, 9, 25, 15, 30, 22, 16, 10, 24, 28, 25, 32, 31, 12, 26, 20, 16, 9, 25, 39, 28, 28, 38, 22, 42, 33, 41, 30, 22, 49, 32, 16, 42, 36, 44, 27, 55]