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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

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

T. D. Noe, Table of n, a(n) for n = 1..10000

MATHEMATICA

Table[Floor[n^(1/DivisorSigma[0, n])], {n, 100}] (* T. D. Noe, May 14 2013 *)

CROSSREFS

Cf. A034884, A175495.

Sequence in context: A033103 A245661 A060775 * A055399 A029426 A085342

Adjacent sequences:  A175491 A175492 A175493 * A175495 A175496 A175497

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 25 21:22 EDT 2017. Contains 287059 sequences.