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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056155 Positive integer k, 1 <= k <= n, which maximizes k^(n+1-k). 2
1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) is within 1 of x, where n+1 = x*(1 + log(x)).

LINKS

Table of n, a(n) for n=1..79.

FORMULA

a(n) ~ e^(LambertW(e*(n + 1)) - 1). - Mats Granvik, Jan 26 2017

EXAMPLE

a(5) = 3 because 3^(5+1-3) = 27 is larger than k^(5+1-k) for any other k (1 <= k <= n) besides k = 3.

MATHEMATICA

nn = 79; Monitor[a = Table[RankedMax[Table[k^(n + 1 - k), {k, 1, n}], 1], {n, 1, nn}]; , n] Monitor[b = Flatten[Table[Position[Table[k^(n + 1 - k), {k, 1, n}], a[[n]]], {n, 1, nn}]], n] (* Mats Granvik, Jan 26 2017 *)

a[n_] := MaximalBy[Range[n], #^(n + 1 - #)&][[1]];

Array[a, 100] (* Jean-Fran├žois Alcover, Dec 11 2020 *)

PROG

(PARI) a(n) = my(v = vector(n, k, k^(n+1-k))); vecsort(v, , 1)[#v]; \\ Michel Marcus, Jan 28 2017

CROSSREFS

Sequence in context: A087831 A194327 A058032 * A157684 A194339 A194335

Adjacent sequences:  A056152 A056153 A056154 * A056156 A056157 A056158

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Jul 30 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 01:48 EDT 2021. Contains 348160 sequences. (Running on oeis4.)