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.

A096275 a(0) = 0, a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n^2.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 5
5 8
6 13
7 21
8 34
9 55
10 89
11 0
12 89
13 89
14 178
15 11
16 189
17 200
18 28
19 228
20 256
21 0
22 256
23 256
24 512
25 92
26 604
27 696
28 459
29 255
30 714
31 969
32 594
33 407
34 1001
35 112
36 1113
37 1225
38 817
39 442
40 1259
41 1701
42 1111
43 876
44 1987
45 747
46 525
47 1272
48 1797
49 569
50 2366
51 231
52 2597
53 2828
54 2400
55 2092

List of values

[0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 0, 89, 89, 178, 11, 189, 200, 28, 228, 256, 0, 256, 256, 512, 92, 604, 696, 459, 255, 714, 969, 594, 407, 1001, 112, 1113, 1225, 817, 442, 1259, 1701, 1111, 876, 1987, 747, 525, 1272, 1797, 569, 2366, 231, 2597, 2828, 2400, 2092]