login
This site is supported by donations to The OEIS 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). 1
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; internal format)
OFFSET

1,2

COMMENTS

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

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.

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 15:39 EST 2012. Contains 205635 sequences.