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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 6
6 1
7 1
8 7
9 7
10 1
11 1
12 20
13 102
14 20
15 1
16 1
17 21
18 122
19 122
20 21
21 1
22 1
23 42
24 591
25 2828
26 591
27 42
28 1
29 1
30 43
31 633
32 3419
33 3419
34 633
35 43
36 1
37 1
38 72
39 1948
40 23544
41 108870
42 23544
43 1948
44 72
45 1
46 1
47 73
48 2020
49 25492
50 132414
51 132414
52 25492
53 2020
54 73
55 1
56 1
57 110
58 4845
59 106920

List of values

[1, 1, 1, 1, 6, 1, 1, 7, 7, 1, 1, 20, 102, 20, 1, 1, 21, 122, 122, 21, 1, 1, 42, 591, 2828, 591, 42, 1, 1, 43, 633, 3419, 3419, 633, 43, 1, 1, 72, 1948, 23544, 108870, 23544, 1948, 72, 1, 1, 73, 2020, 25492, 132414, 132414, 25492, 2020, 73, 1, 1, 110, 4845, 106920]