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.

A217737 a(n) = Fibonacci(n) mod n*(n+1).

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 8
7 13
8 21
9 34
10 55
11 89
12 144
13 51
14 167
15 130
16 171
17 67
18 190
19 1
20 45
21 320
22 1
23 505
24 168
25 275
26 649
27 614
28 319
29 59
30 620
31 125
32 837
33 376
34 407
35 485
36 1296
37 1331
38 419
39 466
40 1435
41 1231
42 1420
43 1289
44 1653
45 830
46 2069
47 2161
48 1344
49 1849
50 1975
51 746
52 1167
53 1589
54 872
55 2645
56 2205

List of values

[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 51, 167, 130, 171, 67, 190, 1, 45, 320, 1, 505, 168, 275, 649, 614, 319, 59, 620, 125, 837, 376, 407, 485, 1296, 1331, 419, 466, 1435, 1231, 1420, 1289, 1653, 830, 2069, 2161, 1344, 1849, 1975, 746, 1167, 1589, 872, 2645, 2205]