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 A275064 #8 Oct 02 2018 04:58:30
%S A275064 1,1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,512,1536,4608,13824,41472,
%T A275064 124416,373248,1119744,3359232,10077696,40310784,161243136,644972544,
%U A275064 2579890176,10319560704,41278242816,165112971264,660451885056,2641807540224
%N A275064 Number of permutations p of [n] such that p(i)-i is a multiple of nine for all i in [n].
%H A275064 Alois P. Heinz, <a href="/A275064/b275064.txt">Table of n, a(n) for n = 0..683</a>
%F A275064 a(n) = Product_{i=0..8} floor((n+i)/9)!.
%F A275064 a(n) ~ (2*Pi*n)^4 * n! / 9^(n + 9/2). - _Vaclav Kotesovec_, Oct 02 2018
%t A275064 Table[Product[Floor[(n + i)/9]!, {i, 0, 8}], {n, 0, 40}] (* _Vaclav Kotesovec_, Oct 02 2018 *)
%Y A275064 Column k=9 of A275062.
%K A275064 nonn
%O A275064 0,11
%A A275064 _Alois P. Heinz_, Jul 15 2016