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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 8
5 1
6 1
7 12
8 12
9 1
10 1
11 16
12 192
13 16
14 1
15 1
16 20
17 320
18 320
19 20
20 1
21 1
22 24
23 480
24 7680
25 480
26 24
27 1
28 1
29 28
30 672
31 13440
32 13440
33 672
34 28
35 1
36 1
37 32
38 896
39 21504
40 430080
41 21504
42 896
43 32
44 1
45 1
46 36
47 1152
48 32256
49 774144
50 774144
51 32256
52 1152
53 36
54 1
55 1
56 40
57 1440
58 46080
59 1290240
60 30965760
61 1290240
62 46080
63 1440
64 40
65 1

List of values

[1, 1, 1, 1, 8, 1, 1, 12, 12, 1, 1, 16, 192, 16, 1, 1, 20, 320, 320, 20, 1, 1, 24, 480, 7680, 480, 24, 1, 1, 28, 672, 13440, 13440, 672, 28, 1, 1, 32, 896, 21504, 430080, 21504, 896, 32, 1, 1, 36, 1152, 32256, 774144, 774144, 32256, 1152, 36, 1, 1, 40, 1440, 46080, 1290240, 30965760, 1290240, 46080, 1440, 40, 1]