This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A158584 #11 Sep 08 2016 04:25:00 %S A158584 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, %T A158584 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, %U A158584 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 %N A158584 Erroneous version of A079866. %C A158584 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. %F A158584 The geometric mean is the n-th root of the product of n numbers. %F A158584 Gm = (a(1)*a(2)*...*a(n))^(1/n). %e A158584 12=2*2*3 has 3 factors; 12^(1/3) = 2.289428... so 2 is in the 11th position in the sequence. %o A158584 (PARI) g(n) = for(x=2,n,print1(floor(x^(1/bigomega(x)))",")) %K A158584 dead %O A158584 2,1 %A A158584 _Cino Hilliard_, Mar 21 2009