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.

A128932 Define the Fibonacci polynomials by F[1] = 1, F[2] = x; for n > 2, F[n] = x*F[n-1] + F[n-2] (cf. A049310, A053119). Swamy's inequality implies that F[n] <= F[n]^2 <= G[n] = (x^2 + 1)^2*(x^2 + 2)^(n-3) for n >= 3 and x >= 1. The sequence gives a triangle of coefficients of G[n] - F[n] read by rows.

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, -2, 5, -1, 4, 0, 1, 3, 0, 9, 0, 12, 0, 6, 0, 1, 8, -3, 28, -4, 38, -1, 25, 0, 8, 0, 1, 15, 0, 58, 0, 99, 0, 87, 0, 41, 0, 10, 0, 1, 32, -4, 144, -10, 272, -6, 280, -1, 170, 0, 61, 0, 12, 0, 1, 63, 0, 310, 0, 673, 0, 825, 0, 619, 0, 292, 0, 85, 0, 14, 0, 1]