login
The OEIS is supported by the many generous donors 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
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, 9, 9, 9, 28, 19, 10, 10, 10, 31, 21, 11, 11, 11, 34, 23, 35, 12, 12, 37, 25, 38, 13, 13, 13, 27, 27, 14, 14, 14, 43, 29, 44, 15, 15, 46, 31, 47, 16, 16, 16, 49, 33, 50, 17, 17, 69, 35, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MATHEMATICA
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}] (* Robert G. Wilson v, Jun 09 2004 *)
CROSSREFS
Sequence in context: A334233 A271058 A107320 * A265340 A356993 A189631
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jun 02 2004
EXTENSIONS
More terms from Don Reble, Jun 04 2004
More terms from Robert G. Wilson v, Jun 09 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 00:47 EDT 2024. Contains 373629 sequences. (Running on oeis4.)