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

%I #8 Mar 11 2014 01:32:53

%S 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,

%T 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,

%U 2,1,8,1,8,2,2,2,2,1,8,1,2,3,9,1,3,3,3

%N a(n) = floor(n^(1/d(n))), where d(n) = number of divisors of n.

%H T. D. Noe, <a href="/A175494/b175494.txt">Table of n, a(n) for n = 1..10000</a>

%t Table[Floor[n^(1/DivisorSigma[0, n])], {n, 100}] (* _T. D. Noe_, May 14 2013 *)

%Y Cf. A034884, A175495.

%K nonn

%O 1,5

%A _Leroy Quet_, May 30 2010

%E More terms from _R. J. Mathar_, May 31 2010

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 16 19:48 EDT 2024. Contains 371754 sequences. (Running on oeis4.)