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.

A171146 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 - 1)*x + 1)^Floor[n/2]] ( correction).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 5
6 1
7 1
8 6
9 6
10 1
11 1
12 18
13 83
14 18
15 1
16 1
17 19
18 101
19 101
20 19
21 1
22 1
23 39
24 510
25 2275
26 510
27 39
28 1
29 1
30 40
31 549
32 2785
33 2785
34 549
35 40
36 1
37 1
38 68
39 1738
40 19856
41 86995
42 19856
43 1738
44 68
45 1
46 1
47 69
48 1806
49 21594
50 106851
51 106851
52 21594
53 1806
54 69
55 1
56 1
57 105
58 4415
59 93030
60 985645

List of values

[1, 1, 1, 1, 5, 1, 1, 6, 6, 1, 1, 18, 83, 18, 1, 1, 19, 101, 101, 19, 1, 1, 39, 510, 2275, 510, 39, 1, 1, 40, 549, 2785, 2785, 549, 40, 1, 1, 68, 1738, 19856, 86995, 19856, 1738, 68, 1, 1, 69, 1806, 21594, 106851, 106851, 21594, 1806, 69, 1, 1, 105, 4415, 93030, 985645]