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.

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

Table of values

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

List of values

[0, 1, 1, 2, 3, 5, 1, 6, 7, 3, 10, 1, 11, 12, 8, 4, 12, 16, 9, 5, 14, 19, 10, 5, 15, 20, 8, 0, 8, 8, 16, 24, 7, 31, 3, 34, 0, 34, 34, 28, 21, 7, 28, 35, 18, 7, 25, 32, 8, 40, 48, 36, 31, 13, 44, 1, 45, 46, 32, 18, 50, 6, 56, 62, 53, 49, 35, 16, 51, 67, 47, 42, 16, 58, 74, 56, 53, 31, 5, 36]

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

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