References to A175494

a(n) = floor(n^(1/d(n))), where d(n) = number of divisors of n.
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


4 seqfan posts

Sun May 30 18:21:27 CEST 2010    [seqfan] Re: n < 2^tau(n)
Sun May 30 19:43:46 CEST 2010    [seqfan] Re: n < 2^tau(n)
Sun May 30 15:18:38 CEST 2010    [seqfan] Re: n < 2^tau(n)
Sun May 30 14:38:38 CEST 2010    [seqfan] n < 2^tau(n)

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .