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.

A335444 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 states that F[n]^2 <= G[n] = (x^2 + 1)^2*(x^2 + 2)^(n-3) for all n >= 3 and all real x. The sequence gives a triangle of the coefficients of the even exponents of G[n] - F[n]^2 read by rows.

Table of values

n a(n)
3 0
4 2
5 1
6 3
7 6
8 2
9 8
10 19
11 14
12 3
13 15
14 52
15 58
16 26
17 4
18 32
19 128
20 192
21 132
22 42
23 5
24 63
25 300
26 558
27 518
28 253
29 62
30 6
31 128
32 679
33 1496
34 1742
35 1152
36 433
37 86
38 7
39 255
40 1506
41 3801
42 5294
43 4413
44 2248
45 684
46 114
47 8
48 512
49 3292
50 9308
51 14999
52 15040
53 9680
54 3992
55 1018
56 146
57 9

List of values

[0, 2, 1, 3, 6, 2, 8, 19, 14, 3, 15, 52, 58, 26, 4, 32, 128, 192, 132, 42, 5, 63, 300, 558, 518, 253, 62, 6, 128, 679, 1496, 1742, 1152, 433, 86, 7, 255, 1506, 3801, 5294, 4413, 2248, 684, 114, 8, 512, 3292, 9308, 14999, 15040, 9680, 3992, 1018, 146, 9]