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.

A175624 a(n) = n! modulo n*(n+1)*(n+2)/3.

Table of values

n a(n)
1 1
2 2
3 6
4 24
5 50
6 48
7 0
8 0
9 210
10 120
11 352
12 168
13 0
14 0
15 800
16 288
17 1122
18 360
19 0
20 0
21 2002
22 528
23 0
24 0
25 0
26 0
27 4032
28 840
29 4930
30 960
31 0
32 0
33 0
34 0
35 8400
36 1368
37 0
38 0
39 11440
40 1680
41 13202
42 1848
43 0
44 0
45 17250
46 2208
47 0
48 0
49 0
50 0
51 24752
52 2808
53 0
54 0
55 0
56 0
57 34162
58 3480
59 37760
60 3720
61 0
62 0
63 0
64 0

List of values

[1, 2, 6, 24, 50, 48, 0, 0, 210, 120, 352, 168, 0, 0, 800, 288, 1122, 360, 0, 0, 2002, 528, 0, 0, 0, 0, 4032, 840, 4930, 960, 0, 0, 0, 0, 8400, 1368, 0, 0, 11440, 1680, 13202, 1848, 0, 0, 17250, 2208, 0, 0, 0, 0, 24752, 2808, 0, 0, 0, 0, 34162, 3480, 37760, 3720, 0, 0, 0, 0]