|
|
A003320
|
|
a(n) = max_{k=0..n} k^(n-k).
(Formerly M1198)
|
|
11
|
|
|
1, 1, 1, 2, 4, 9, 27, 81, 256, 1024, 4096, 16384, 78125, 390625, 1953125, 10077696, 60466176, 362797056, 2176782336, 13841287201, 96889010407, 678223072849, 4747561509943, 35184372088832, 281474976710656, 2251799813685248
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
I. Tomescu, Introducere in Combinatorica. Editura Tehnica, Bucharest, 1972, p. 231.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(5) = max(5^0, 4^1, 3^2, 2^3, 1^4, 0^5) = max(1,4,9,8,1,0) = 9.
|
|
MATHEMATICA
|
Join[{1}, Max[#]&/@Table[k^(n-k), {n, 25}, {k, n}]] (* Harvey P. Dale, Jun 20 2011 *)
|
|
PROG
|
(Haskell)
a003320 n = maximum $ zipWith (^) [0 .. n] [n, n-1 ..]
(PARI) a(n) = vecmax(vector(n+1, k, (k-1)^(n-k+1))); \\ Michel Marcus, Jun 13 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Easdown reference from Michail Kats (KatsMM(AT)info.sgu.ru)
|
|
STATUS
|
approved
|
|
|
|