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 A226286 #9 May 29 2014 12:52:00 %S A226286 0,0,0,0,0,0,0,0,0,14400,518400,18662400,457228800,11202105600, %T A226286 238978252800,5098202726400,103238605209600,2090581755494400, %U A226286 41811635109888000,836232702197760000,16864026160988160000 %N A226286 [n/2]!*[(n+1)/2]!*C([n/2],5)*C([(n+1)/2],5). %C A226286 Number of permutations of n elements with 10 odd displacements. %C A226286 Column 6 of A226288. %C A226286 Column k=10 of A145893, a diagonal of A145894. - _Alois P. Heinz_, May 29 2014 %H A226286 R. H. Hardin, <a href="/A226286/b226286.txt">Table of n, a(n) for n = 1..210</a> %K A226286 nonn %O A226286 1,10 %A A226286 _R. H. Hardin_, connection of formula with combinatoric problem via _N. J. A. Sloane_ in the Sequence Fans Mailing List, Jun 02 2013