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.

A171145 The sequence of coefficients of a polynomial recursion: p(x,n)=If[Mod[n, 2] == 0, (x + 1)*p(x, n - 1), (x^2 + n*x + 1)^Floor[n/2]].

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 4
9 4
10 1
11 1
12 10
13 27
14 10
15 1
16 1
17 11
18 37
19 37
20 11
21 1
22 1
23 21
24 150
25 385
26 150
27 21
28 1
29 1
30 22
31 171
32 535
33 535
34 171
35 22
36 1
37 1
38 36
39 490
40 3024
41 7539
42 3024
43 490
44 36
45 1
46 1
47 37
48 526
49 3514
50 10563
51 10563
52 3514
53 526
54 37
55 1
56 1
57 55
58 1215
59 13530
60 76845
61 188001
62 76845

List of values

[1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 10, 27, 10, 1, 1, 11, 37, 37, 11, 1, 1, 21, 150, 385, 150, 21, 1, 1, 22, 171, 535, 535, 171, 22, 1, 1, 36, 490, 3024, 7539, 3024, 490, 36, 1, 1, 37, 526, 3514, 10563, 10563, 3514, 526, 37, 1, 1, 55, 1215, 13530, 76845, 188001, 76845]