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!)
A175494 a(n) = floor(n^(1/d(n))), where d(n) = number of divisors of n. 2
1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 4, 1, 4, 1, 2, 2, 4, 1, 2, 2, 2, 1, 5, 1, 5, 1, 2, 2, 2, 1, 6, 2, 2, 1, 6, 1, 6, 1, 1, 2, 6, 1, 3, 1, 2, 1, 7, 1, 2, 1, 2, 2, 7, 1, 7, 2, 1, 1, 2, 1, 8, 2, 2, 1, 8, 1, 8, 2, 2, 2, 2, 1, 8, 1, 2, 3, 9, 1, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
MATHEMATICA
Table[Floor[n^(1/DivisorSigma[0, n])], {n, 100}] (* T. D. Noe, May 14 2013 *)
CROSSREFS
Sequence in context: A345934 A060775 A355368 * A055399 A029426 A369916
KEYWORD
nonn
AUTHOR
Leroy Quet, May 30 2010
EXTENSIONS
More terms from R. J. Mathar, May 31 2010
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 April 19 23:40 EDT 2024. Contains 371798 sequences. (Running on oeis4.)