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.

A342088 Triangle read by rows: T(n,k) is the number of n-colorings of the vertices of the k-dimensional cross polytope such that no two adjacent vertices have the same color. 0 <= k <= n.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 2
6 1
7 9
8 18
9 6
10 1
11 16
12 84
13 96
14 24
15 1
16 25
17 260
18 780
19 600
20 120
21 1
22 36
23 630
24 4080
25 7560
26 4320
27 720
28 1
29 49
30 1302
31 15330
32 61320
33 78120
34 35280
35 5040
36 1
37 64
38 2408
39 45696
40 351120
41 913920
42 866880
43 322560
44 40320

List of values

[1, 1, 1, 1, 4, 2, 1, 9, 18, 6, 1, 16, 84, 96, 24, 1, 25, 260, 780, 600, 120, 1, 36, 630, 4080, 7560, 4320, 720, 1, 49, 1302, 15330, 61320, 78120, 35280, 5040, 1, 64, 2408, 45696, 351120, 913920, 866880, 322560, 40320]