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.

A354443 a(n) = Fibonacci(n^n) mod n.

Table of values

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

List of values

[0, 1, 2, 3, 0, 0, 6, 3, 7, 5, 1, 0, 12, 7, 10, 11, 16, 0, 1, 15, 5, 3, 22, 0, 0, 3, 20, 7, 1, 0, 1, 27, 13, 1, 5, 0, 36, 3, 25, 35, 1, 0, 42, 19, 20, 21, 46, 0, 36, 25, 17, 3, 52, 0, 5, 35, 34, 1, 1, 0, 1, 3, 43, 59, 15, 30, 66, 35, 44, 35, 1, 0, 72, 3, 50, 3, 2, 60, 1, 75, 7]