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.

A174450 Triangle T(n, k, q) = n!*(n+1)!*q^k/((n-k)!(n-k+1)!) if floor(n/2) > k-1, otherwise n!*(n+1)!*q^(n-k)/(k!*(k+1)!) for q = 2, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 12
5 1
6 1
7 24
8 24
9 1
10 1
11 40
12 960
13 40
14 1
15 1
16 60
17 2400
18 2400
19 60
20 1
21 1
22 84
23 5040
24 201600
25 5040
26 84
27 1
28 1
29 112
30 9408
31 564480
32 564480
33 9408
34 112
35 1
36 1
37 144
38 16128
39 1354752
40 81285120
41 1354752
42 16128
43 144
44 1
45 1
46 180
47 25920
48 2903040
49 243855360
50 243855360
51 2903040
52 25920
53 180
54 1

List of values

[1, 1, 1, 1, 12, 1, 1, 24, 24, 1, 1, 40, 960, 40, 1, 1, 60, 2400, 2400, 60, 1, 1, 84, 5040, 201600, 5040, 84, 1, 1, 112, 9408, 564480, 564480, 9408, 112, 1, 1, 144, 16128, 1354752, 81285120, 1354752, 16128, 144, 1, 1, 180, 25920, 2903040, 243855360, 243855360, 2903040, 25920, 180, 1]