cp's OEIS Frontend

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.

A070009 Least number m such that the arithmetic mean of the distinct prime divisors of m is equal to 2^n.

This page as a plain text file.
%I A070009 #14 Mar 28 2015 22:36:39
%S A070009 2,15,39,87,183,2071,1255,1527,3063,18402,12279,106327,49143,622231,
%T A070009 589794,1703767,1310695,9961111,3145719,31457210,12582903,310377127,
%U A070009 50331639,2046816631,335544295,10603194271,8858369762,1610612727,44023413103,40802188951
%N A070009 Least number m such that the arithmetic mean of the distinct prime divisors of m is equal to 2^n.
%C A070009 Are there any terms with more than 3 prime factors? - _David Wasserman_, May 05 2003
%F A070009 a(n) = Min{x; A008472(x)/A001221(x)=2^n}.
%e A070009 a(15) = 589794 because m = 2*3*98299; mean = (2+3+98299)/3 = 32768 = 2^15.
%t A070009 a = Table[0, {21}]; Do[b = Transpose[ FactorInteger[n]][[1]]; c = Log[2, Apply[ Plus, b] / Length[b]]; If[ IntegerQ[c] && a[[c]] == 0, a[[c]] = n], {n, 2, 10^8/3}]; a
%Y A070009 Cf. A070005, A070006, A070007, A070008, A070009, A008472, A001414, A001221.
%K A070009 nonn
%O A070009 1,1
%A A070009 _Labos Elemer_, Apr 11 2002
%E A070009 Edited and extended by _Robert G. Wilson v_, Apr 30 2002
%E A070009 More terms from _David Wasserman_, May 05 2003
%E A070009 a(29)-a(30) from _Donovan Johnson_, Aug 06 2012