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.

A121343 a(n) = Fibonacci(n) mod n(n+1)/2.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 3
5 5
6 8
7 13
8 21
9 34
10 0
11 23
12 66
13 51
14 62
15 10
16 35
17 67
18 19
19 1
20 45
21 89
22 1
23 229
24 168
25 275
26 298
27 236
28 319
29 59
30 155
31 125
32 309
33 376
34 407
35 485
36 630
37 628
38 419
39 466
40 615
41 370
42 517
43 343
44 663
45 830
46 988
47 1033
48 168
49 624
50 700
51 746
52 1167
53 158
54 872
55 1105
56 609
57 610
58 59
59 1181
60 0
61 1
62 125

List of values

[0, 0, 1, 2, 3, 5, 8, 13, 21, 34, 0, 23, 66, 51, 62, 10, 35, 67, 19, 1, 45, 89, 1, 229, 168, 275, 298, 236, 319, 59, 155, 125, 309, 376, 407, 485, 630, 628, 419, 466, 615, 370, 517, 343, 663, 830, 988, 1033, 168, 624, 700, 746, 1167, 158, 872, 1105, 609, 610, 59, 1181, 0, 1, 125]