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.

A051831 a(n) = Fibonacci(prime(n)) mod prime(n), where prime(n) is the n-th prime.

Table of values

n a(n)
1 1
2 2
3 0
4 6
5 1
6 12
7 16
8 1
9 22
10 1
11 1
12 36
13 1
14 42
15 46
16 52
17 1
18 1
19 66
20 1
21 72
22 1
23 82
24 1
25 96
26 1
27 102
28 106
29 1
30 112
31 126
32 1
33 136
34 1
35 1
36 1
37 156
38 162
39 166
40 172
41 1
42 1
43 1
44 192
45 196
46 1
47 1
48 222
49 226
50 1
51 232
52 1
53 1
54 1
55 256
56 262
57 1
58 1
59 276
60 1
61 282
62 292
63 306
64 1
65 312
66 316
67 1
68 336
69 346
70 1
71 352
72 1

List of values

[1, 2, 0, 6, 1, 12, 16, 1, 22, 1, 1, 36, 1, 42, 46, 52, 1, 1, 66, 1, 72, 1, 82, 1, 96, 1, 102, 106, 1, 112, 126, 1, 136, 1, 1, 1, 156, 162, 166, 172, 1, 1, 1, 192, 196, 1, 1, 222, 226, 1, 232, 1, 1, 1, 256, 262, 1, 1, 276, 1, 282, 292, 306, 1, 312, 316, 1, 336, 346, 1, 352, 1]