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.
%I A216441 #11 Feb 15 2017 02:56:51
%S A216441 0,0,6,32,190,1332,10654,95888,958878,10547660,126571918,1645434936,
%T A216441 23036089102,345541336532,5528661384510,93987243536672,
%U A216441 1691770383660094,32143637289541788,642872745790835758,13500327661607550920,297007208555366120238,6831165796773420765476
%N A216441 a(n) = n! mod !n.
%C A216441 !n is a subfactorial number (A000166).
%H A216441 Indranil Ghosh, <a href="/A216441/b216441.txt">Table of n, a(n) for n = 2..449</a>
%e A216441 a(5) = 5! mod !5 = 120 mod 44 = 32. - _Indranil Ghosh_, Feb 15 2017
%p A216441 with(numtheory): f:=n->sum(n!*(((-1)^k)*1/k!), k=0..n):for n from 1 to 30 do: x:=irem(n!,f(n)): printf(`%d, `, x):od:
%t A216441 Table[Mod[n !, Subfactorial[n]],{n,100} ]
%Y A216441 Cf. A000166, A000142, A055596.
%K A216441 nonn
%O A216441 2,3
%A A216441 _Michel Lagneau_, Sep 07 2012