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.

A096535 a(0) = a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n.

Table of values

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

List of values

[1, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 10, 3, 0, 3, 3, 6, 9, 15, 5, 0, 5, 5, 10, 15, 0, 15, 15, 2, 17, 19, 5, 24, 29, 19, 13, 32, 8, 2, 10, 12, 22, 34, 13, 3, 16, 19, 35, 6, 41, 47, 37, 32, 16, 48, 9, 1, 10, 11, 21, 32, 53, 23, 13, 36, 49, 19, 1, 20, 21, 41, 62, 31, 20, 51, 71, 46, 40, 8, 48, 56]