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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 1
6 1
7 6
8 6
9 1
10 1
11 8
12 48
13 8
14 1
15 1
16 10
17 80
18 80
19 10
20 1
21 1
22 12
23 120
24 960
25 120
26 12
27 1
28 1
29 14
30 168
31 1680
32 1680
33 168
34 14
35 1
36 1
37 16
38 224
39 2688
40 26880
41 2688
42 224
43 16
44 1
45 1
46 18
47 288
48 4032
49 48384
50 48384
51 4032
52 288
53 18
54 1
55 1
56 20
57 360
58 5760
59 80640
60 967680
61 80640
62 5760
63 360
64 20
65 1

List of values

[1, 1, 1, 1, 4, 1, 1, 6, 6, 1, 1, 8, 48, 8, 1, 1, 10, 80, 80, 10, 1, 1, 12, 120, 960, 120, 12, 1, 1, 14, 168, 1680, 1680, 168, 14, 1, 1, 16, 224, 2688, 26880, 2688, 224, 16, 1, 1, 18, 288, 4032, 48384, 48384, 4032, 288, 18, 1, 1, 20, 360, 5760, 80640, 967680, 80640, 5760, 360, 20, 1]