The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125229 a(n) = j such that i^j is maximized subject to i+j = n (i >= 0, j >= 0). 1
 0, 0, 0, 1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, 9, 9, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 21, 22, 23, 24, 25, 25, 26, 27, 28, 28, 29, 30, 31, 32, 32, 33, 34, 35, 35, 36, 37, 38, 39, 39, 40, 41, 42, 42, 43, 44, 45, 46, 46, 47, 48, 49, 50, 50, 51, 52 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS For n = 2, there is not a unique maximum because 2^0 = 1^1; we choose j = 0. - T. D. Noe, Apr 08 2014 LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 EXAMPLE If the sum is 5, the powers are: 0^5, 1^4, 2^3, 3^2, 4^1 and 5^0. The highest is 3^2 so a(5) = 2. MATHEMATICA Join[{0, 0}, Table[SortBy[{#[[1]], #[[2]], #[[1]]^#[[2]]}&/@Flatten[ Permutations /@ IntegerPartitions[n, {2}], 1], Last][[-1, 2]], {n, 3, 80}]] (* Harvey P. Dale, Sep 01 2013 *) Join[{0, 0, 0}, Flatten[Table[s = Table[(n - k)^k, {k, n}]; Position[s, Max[s]], {n, 3, 80}]]] (* T. D. Noe, Apr 08 2014 *) CROSSREFS Cf. A056155. Sequence in context: A188511 A064488 A049472 * A213855 A272206 A122797 Adjacent sequences:  A125226 A125227 A125228 * A125230 A125231 A125232 KEYWORD easy,nonn AUTHOR Sébastien Dumortier, Jan 15 2007 EXTENSIONS a(0) added by T. D. Noe, Apr 08 2014 STATUS approved

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

Last modified June 12 14:45 EDT 2021. Contains 344957 sequences. (Running on oeis4.)