login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A272645 a(n) = largest term in row n of array in A272644. 2
1, 1, 5, 13, 73, 301, 2069, 11581, 95401, 673261, 6487445, 55213453, 610093513, 6077248381, 75796724309, 864806272861, 12020754177001, 154546274524621, 2369364111428885, 33888536448984493, 568128719132038153, 8947078682269788061 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,3
LINKS
Irving Kaplansky and John Riordan, The problem of the rooks and its applications, Duke Mathematical Journal 13.2 (1946): 259-268. The array is on page 267.
FORMULA
See A272644.
PROG
(PARI)
A(n, m) = sum(i=0, m, stirling(m+1, i+1, 2) * (-1)^((m-i)%2) * i^(n - m) * i!);
apply(vecmax, vector(22, n, vector(n, m, A(n+1, m)))) \\ Gheorghe Coserea, May 16 2016
CROSSREFS
Cf. A272644.
Sequence in context: A100209 A139361 A115329 * A137702 A140120 A303962
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 07 2016
EXTENSIONS
More terms from Gheorghe Coserea, May 16 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)