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 A275063 #10 Oct 02 2018 04:57:41
%S A275063 1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,768,2304,6912,20736,62208,
%T A275063 186624,559872,1679616,6718464,26873856,107495424,429981696,
%U A275063 1719926784,6879707136,27518828544,110075314176,550376570880,2751882854400,13759414272000
%N A275063 Number of permutations p of [n] such that p(i)-i is a multiple of eight for all i in [n].
%H A275063 Alois P. Heinz, <a href="/A275063/b275063.txt">Table of n, a(n) for n = 0..665</a>
%F A275063 a(n) = Product_{i=0..7} floor((n+i)/8)!.
%F A275063 a(n) ~ (2*Pi*n)^(7/2) * n! / 8^(n + 4). - _Vaclav Kotesovec_, Oct 02 2018
%e A275063 a(9) = 2: 123456789, 923456781.
%t A275063 Table[Product[Floor[(n + i)/8]!, {i, 0, 7}], {n, 0, 40}] (* _Vaclav Kotesovec_, Oct 02 2018 *)
%Y A275063 Column k=8 of A275062.
%K A275063 nonn
%O A275063 0,10
%A A275063 _Alois P. Heinz_, Jul 15 2016