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.

A223489 a(n) = number of missing residues in the Lucas sequence mod the n-th prime number.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 4
6 1
7 1
8 7
9 4
10 19
11 12
12 9
13 22
14 10
15 32
16 9
17 22
18 33
19 16
20 27
21 17
22 30
23 20
24 65
25 17
26 66
27 24
28 74
29 61
30 73
31 30
32 49
33 37
34 106
35 77
36 114
37 33
38 40
39 40
40 49
41 67
42 119
43 72
44 49
45 49
46 183
47 181
48 54
49 56
50 149
51 205
52 90
53 138
54 94
55 61
56 178
57 149
58 102
59 73
60 254
61 70
62 81
63 264
64 117
65 69

List of values

[0, 0, 1, 0, 4, 1, 1, 7, 4, 19, 12, 9, 22, 10, 32, 9, 22, 33, 16, 27, 17, 30, 20, 65, 17, 66, 24, 74, 61, 73, 30, 49, 37, 106, 77, 114, 33, 40, 40, 49, 67, 119, 72, 49, 49, 183, 181, 54, 56, 149, 205, 90, 138, 94, 61, 178, 149, 102, 73, 254, 70, 81, 264, 117, 69]