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 A263757 #30 Jan 24 2019 14:24:21 %S A263757 1,1,1,1,2,3,1,4,7,12,1,7,17,35,60,1,12,44,93,210,360,1,20,103,275, %T A263757 651,1470,2520,1,33,234,877,2047,5208,11760,20160,1,54,533,2544,7173, %U A263757 18423,46872,105840,181440,1,88,1196,7135,27085,67545,184230,468720,1058400,1814400 %N A263757 Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n with maximal difference k between elements in the same cycle. %C A263757 Row sums give A000142, n >= 1. %C A263757 Main diagonal gives A001710. - _Alois P. Heinz_, Sep 20 2016 %H A263757 Alois P. Heinz, <a href="/A263757/b263757.txt">Rows n = 1..15, flattened</a> %H A263757 FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000209">Maximum difference of elements in cycles</a>. %F A263757 T(n,k) = A276837(n,k+1) - A276837(n,k). - _Alois P. Heinz_, Sep 20 2016 %e A263757 Triangle begins: %e A263757 1; %e A263757 1, 1; %e A263757 1, 2, 3; %e A263757 1, 4, 7, 12; %e A263757 1, 7, 17, 35, 60; %e A263757 1, 12, 44, 93, 210, 360; %e A263757 ... %Y A263757 Cf. A000071, A000142, A001710, A276727, A276837, A276974, A277031. %K A263757 nonn,tabl %O A263757 1,5 %A A263757 _Christian Stump_, Oct 25 2015 %E A263757 More terms (rows n=7-10) from _Alois P. Heinz_, Sep 20 2016