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.

A325174 a(n) = Fibonacci(n)^n mod prime(n).

Table of values

n a(n)
1 1
2 1
3 3
4 4
5 1
6 12
7 4
8 9
9 19
10 5
11 27
12 10
13 30
14 36
15 46
16 16
17 27
18 34
19 58
20 32
21 9
22 62
23 2
24 1
25 53
26 92
27 30
28 35
29 76
30 52
31 9
32 4
33 70
34 81
35 105
36 59
37 61
38 90
39 82
40 139
41 19
42 29
43 28
44 81
45 92
46 1
47 121
48 34
49 155
50 165
51 1
52 36
53 178
54 103
55 230
56 50
57 266
58 106
59 135
60 222
61 272
62 4
63 72
64 253
65 182
66 308
67 20
68 32
69 166
70 206

List of values

[1, 1, 3, 4, 1, 12, 4, 9, 19, 5, 27, 10, 30, 36, 46, 16, 27, 34, 58, 32, 9, 62, 2, 1, 53, 92, 30, 35, 76, 52, 9, 4, 70, 81, 105, 59, 61, 90, 82, 139, 19, 29, 28, 81, 92, 1, 121, 34, 155, 165, 1, 36, 178, 103, 230, 50, 266, 106, 135, 222, 272, 4, 72, 253, 182, 308, 20, 32, 166, 206]