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.

A171412 Triangle read by rows (n >= 1): T(n,k) = [x^k] p(x,n), where p(x,n) = (x^3 + x^2 + x + 1)^floor(n/2) if n is odd, and p(x,n) = (x + 1)*p(x,n-1) otherwise.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 2
10 2
11 2
12 1
13 1
14 2
15 3
16 4
17 3
18 2
19 1
20 1
21 3
22 5
23 7
24 7
25 5
26 3
27 1
28 1
29 3
30 6
31 10
32 12
33 12
34 10
35 6
36 3
37 1
38 1
39 4
40 9
41 16
42 22
43 24
44 22
45 16
46 9
47 4
48 1
49 1
50 4
51 10
52 20
53 31
54 40
55 44
56 40
57 31
58 20
59 10
60 4
61 1
62 1
63 5
64 14
65 30
66 51
67 71
68 84
69 84
70 71
71 51
72 30
73 14
74 5
75 1
76 1
77 5
78 15
79 35
80 65
81 101
82 135
83 155
84 155
85 135
86 101
87 65
88 35
89 15
90 5
91 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 3, 4, 3, 2, 1, 1, 3, 5, 7, 7, 5, 3, 1, 1, 3, 6, 10, 12, 12, 10, 6, 3, 1, 1, 4, 9, 16, 22, 24, 22, 16, 9, 4, 1, 1, 4, 10, 20, 31, 40, 44, 40, 31, 20, 10, 4, 1, 1, 5, 14, 30, 51, 71, 84, 84, 71, 51, 30, 14, 5, 1, 1, 5, 15, 35, 65, 101, 135, 155, 155, 135, 101, 65, 35, 15, 5, 1]