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.

A079777 a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2)) (mod n).

Table of values

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

List of values

[0, 1, 1, 2, 3, 0, 3, 3, 6, 0, 6, 6, 0, 6, 6, 12, 2, 14, 16, 11, 7, 18, 3, 21, 0, 21, 21, 15, 8, 23, 1, 24, 25, 16, 7, 23, 30, 16, 8, 24, 32, 15, 5, 20, 25, 0, 25, 25, 2, 27, 29, 5, 34, 39, 19, 3, 22, 25, 47, 13, 0, 13, 13, 26, 39, 0, 39, 39, 10, 49, 59, 37, 24, 61, 11, 72, 7, 2, 9, 11, 20]