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.

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

Table of values

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

List of values

[0, 1, 1, 2, 0, 3, 2, 2, 1, 5, 1, 0, 8, 13, 10, 2, 12, 15, 5, 10, 1, 1, 1, 0, 0, 25, 1, 2, 5, 15, 27, 2, 10, 33, 20, 0, 1, 1, 34, 10, 40, 21, 18, 2, 10, 1, 1, 0, 1, 25, 1, 2, 16, 21, 5, 26, 37, 1, 7, 0, 33, 27, 1, 2, 40, 21, 5, 2, 1, 15, 1, 0, 46, 1, 25, 2, 68]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.