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 A272645 #12 May 17 2016 05:40:03 %S A272645 1,1,5,13,73,301,2069,11581,95401,673261,6487445,55213453,610093513, %T A272645 6077248381,75796724309,864806272861,12020754177001,154546274524621, %U A272645 2369364111428885,33888536448984493,568128719132038153,8947078682269788061 %N A272645 a(n) = largest term in row n of array in A272644. %H A272645 Gheorghe Coserea, <a href="/A272645/b272645.txt">Table of n, a(n) for n = 2..101</a> %H A272645 Irving Kaplansky and John Riordan, <a href="http://projecteuclid.org/euclid.dmj/1077473616">The problem of the rooks and its applications</a>, Duke Mathematical Journal 13.2 (1946): 259-268. The array is on page 267. %F A272645 See A272644. %o A272645 (PARI) %o A272645 A(n,m) = sum(i=0, m, stirling(m+1, i+1, 2) * (-1)^((m-i)%2) * i^(n - m) * i!); %o A272645 apply(vecmax, vector(22, n, vector(n, m, A(n+1, m)))) \\ _Gheorghe Coserea_, May 16 2016 %Y A272645 Cf. A272644. %K A272645 nonn,easy %O A272645 2,3 %A A272645 _N. J. A. Sloane_, May 07 2016 %E A272645 More terms from _Gheorghe Coserea_, May 16 2016