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.

A263101 a(n) = F(F(n)) mod F(n), where F = Fibonacci = A000045.

Table of values

n a(n)
1 0
2 0
3 1
4 2
5 0
6 5
7 12
8 5
9 33
10 5
11 1
12 0
13 232
14 233
15 55
16 5
17 1596
18 2563
19 1
20 5
21 987
22 10946
23 28656
24 0
25 0
26 75025
27 189653
28 89
29 1
30 6765
31 1
32 5
33 6765
34 1
35 9227460
36 0
37 24157816
38 1
39 63245985
40 5
41 1
42 267914275
43 433494436
44 4181
45 1134896405
46 1
47 2971215072
48 0
49 7778741816
50 75025

List of values

[0, 0, 1, 2, 0, 5, 12, 5, 33, 5, 1, 0, 232, 233, 55, 5, 1596, 2563, 1, 5, 987, 10946, 28656, 0, 0, 75025, 189653, 89, 1, 6765, 1, 5, 6765, 1, 9227460, 0, 24157816, 1, 63245985, 5, 1, 267914275, 433494436, 4181, 1134896405, 1, 2971215072, 0, 7778741816, 75025]