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.

A343575 a(n) = floor((2+sqrt(5))^n - 2^(n+1)) mod (20*n).

Table of values

n a(n)
1 0
2 9
3 0
4 49
5 0
6 9
7 0
8 129
9 60
10 49
11 0
12 49
13 0
14 9
15 100
16 129
17 0
18 249
19 0
20 49
21 340
22 9
23 0
24 449
25 0
26 9
27 240
28 289
29 0
30 249
31 0
32 129
33 60
34 9
35 600
36 49
37 0
38 9
39 580
40 449
41 0
42 609
43 0
44 289
45 700
46 9
47 0
48 449
49 700
50 249
51 60
52 289
53 0
54 969
55 200
56 129
57 60
58 9
59 0
60 49
61 0
62 9
63 1240
64 769
65 0
66 369
67 0

List of values

[0, 9, 0, 49, 0, 9, 0, 129, 60, 49, 0, 49, 0, 9, 100, 129, 0, 249, 0, 49, 340, 9, 0, 449, 0, 9, 240, 289, 0, 249, 0, 129, 60, 9, 600, 49, 0, 9, 580, 449, 0, 609, 0, 289, 700, 9, 0, 449, 700, 249, 60, 289, 0, 969, 200, 129, 60, 9, 0, 49, 0, 9, 1240, 769, 0, 369, 0]