OFFSET
0,3
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Danny Rorabaugh, Table of n, a(n) for n = 0..400 (first 251 terms from Reinhard Zumkeller)
Victor Meally, Comparison of several sequences given in Motzkin's paper "Sorting numbers for cylinders...", letter to N. J. A. Sloane, N. D.
T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176. [Annotated, scanned copy]
OEIS Wiki, Sorting numbers
MAPLE
MATHEMATICA
A019538[n_, k_] := k!*StirlingS2[n, k]; f[0] = 1; f[n_] := Module[{t1, k}, t1 = 0; For[k = 1, k <= n, k++, If[t1 < A019538[n, k], t1 = A019538[n, k]]]; t1]; Table[f[n], {n, 0, 20}] (* Jean-François Alcover, Dec 26 2013, after Maple *)
PROG
(Haskell)
a002869 0 = 1
a002869 n = maximum $ a019538_row n
-- Reinhard Zumkeller, Dec 15 2013
(Sage)
def A002869(n):
return max(factorial(k)*stirling_number2(n, k) for k in range(1, n+1))
[A002869(i) for i in range(1, 20)] # Danny Rorabaugh, Oct 10 2015
CROSSREFS
KEYWORD
nonn,nice,easy
AUTHOR
STATUS
approved