login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A066296
a(n) = floor(n^(1/omega(n))).
2
2, 3, 4, 5, 2, 7, 8, 9, 3, 11, 3, 13, 3, 3, 16, 17, 4, 19, 4, 4, 4, 23, 4, 25, 5, 27, 5, 29, 3, 31, 32, 5, 5, 5, 6, 37, 6, 6, 6, 41, 3, 43, 6, 6, 6, 47, 6, 49, 7, 7, 7, 53, 7, 7, 7, 7, 7, 59, 3, 61, 7, 7, 64, 8, 4, 67, 8, 8, 4, 71, 8, 73, 8, 8, 8, 8, 4, 79, 8, 81, 9, 83, 4, 9, 9, 9, 9, 89, 4, 9, 9
OFFSET
2,1
LINKS
Harry J. Smith, Table of n, a(n) for n = 2..1000 [Corrected by Sean A. Irvine]
FORMULA
a(n) = floor(n^(1/omega(n))) = floor(n^(1/A001221(n))).
a(n) = n if n is a prime power (A246655).
MATHEMATICA
Table[Floor[n^(1/PrimeNu[n])], {n, 2, 50}] (* G. C. Greubel, May 08 2017 *)
PROG
(PARI) { for (n=2, 1000, a=floor(n^(1/omega(n))); write("b066296.txt", n, " ", a) ) } \\ Harry J. Smith, Feb 08 2010
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Dec 12 2001
STATUS
approved