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”).

A158584
Erroneous version of A079866.
0
2, 3, 1, 5, 2, 7, 1, 3, 3, 11, 2, 13, 3, 3, 1, 17, 2, 19, 2, 4, 4, 23, 2, 4, 5, 3, 3, 29, 3, 31, 1, 5, 5, 5, 2, 37, 6, 6, 2, 41, 3, 43, 3, 3, 6, 47, 2, 7, 3, 7, 3, 53, 2, 7, 2, 7, 7, 59, 2, 61, 7, 3, 1, 8, 4, 67, 4, 8, 4, 71, 2, 73, 8, 4, 4, 8, 4, 79, 2, 3, 9, 83, 3, 9, 9, 9, 3, 89, 3, 9, 4, 9, 9, 9, 2, 97
OFFSET
2,1
COMMENTS
We do not begin with the unit 1 because it has no prime factors. Conjecture: The sequence contains the set of prime numbers more than once.
FORMULA
The geometric mean is the n-th root of the product of n numbers.
Gm = (a(1)*a(2)*...*a(n))^(1/n).
EXAMPLE
12=2*2*3 has 3 factors; 12^(1/3) = 2.289428... so 2 is in the 11th position in the sequence.
PROG
(PARI) g(n) = for(x=2, n, print1(floor(x^(1/bigomega(x)))", "))
CROSSREFS
Sequence in context: A277698 A134194 A308707 * A086112 A138798 A277708
KEYWORD
dead
AUTHOR
Cino Hilliard, Mar 21 2009
STATUS
approved