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.

A116219 If X_1,...,X_n is a partition of a 3n-set X into 3-blocks then a(n) is equal to the number of permutations f of X such that f(X_i) <> X_i, (i=1,...,n).

Table of values

n a(n)
1 0
2 684
3 350352
4 470444112
5 1293433432704
6 6355554535465920
7 50823027472983319296
8 618002474327361540442368
9 10855431334634213344062394368
10 264600531449039456516679858441216
11 8665832467934840277899318819803484160
12 371368757645100314808527266212241861300224

List of values

[0, 684, 350352, 470444112, 1293433432704, 6355554535465920, 50823027472983319296, 618002474327361540442368, 10855431334634213344062394368, 264600531449039456516679858441216, 8665832467934840277899318819803484160, 371368757645100314808527266212241861300224]