login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095186 a(n) = least k such that k*n^(1/n) differs from an integer by at most 1/n. 0

%I

%S 1,1,2,2,3,3,3,3,4,4,4,4,9,5,5,5,11,6,6,6,13,13,7,7,7,15,23,8,8,25,17,

%T 9,9,9,28,19,10,10,10,31,21,11,11,11,34,23,35,12,12,37,25,38,13,13,13,

%U 27,27,14,14,14,43,29,44,15,15,46,31,47,16,16,16,49,33,50,17,17,69,35,35

%N a(n) = least k such that k*n^(1/n) differs from an integer by at most 1/n.

%t a[n_] := Block[{k = 1}, While[n*Abs[k*n^(1/n) - Round[k*n^(1/n)]] > 1, k++ ]; k]; Table[ a[n], {n, 80}] (from Robert G. Wilson v Jun 09 2004)

%K nonn

%O 1,3

%A Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 02 2004

%E More terms from Don Reble (djr(AT)nk.ca), Jun 04 2004

%E More terms from _Robert G. Wilson v_, Jun 09 2004

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 May 23 17:52 EDT 2013. Contains 225611 sequences.