id:A056155 - OEIS Search Results

Search: id:A056155

Displaying 1-1 of 1 results found.

page 1

Positive integer k, 1 <= k <= n, which maximizes k^(n+1-k).

+0
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; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) is within 1 of x, where n+1 = x*(1 + ln(x)).`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	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: A087843 A087831 A058032 this_sequence A157684 A026099 A049727` `Adjacent sequences: A056152 A056153 A056154 this_sequence A056156 A056157 A056158`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet Jul 30 2000`

page 1

Search completed in 0.002 seconds

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.

AT&T Labs Research