The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070006 Composite numbers that are not a prime power and whose distinct prime divisors' arithmetic mean is a prime. 5

%I

%S 21,33,57,63,69,85,93,99,105,129,133,145,147,171,177,189,195,205,207,

%T 213,217,231,237,249,253,265,279,297,309,315,363,387,393,417,425,441,

%U 445,465,469,483,489,493,505,513,517,525,531,553,565,567,573,585,597

%N Composite numbers that are not a prime power and whose distinct prime divisors' arithmetic mean is a prime.

%C Subsequence of A070005.

%H Michael De Vlieger, <a href="/A070006/b070006.txt">Table of n, a(n) for n = 1..10000</a>

%e n = 993 = 3*331, mean = 334/2 = 167, a prime.

%t ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] Do[s=Apply[Plus, ba[n]]/lf[n]; If[PrimeQ[s]&&Greater[lf[n], 1], Print[n]], {n, 2, 1000}]

%t (* Second program: *)

%t Select[Range@ 600, And[! PrimePowerQ@ #, PrimeQ@ Mean[FactorInteger[#][[All, 1]]]] &] (* _Michael De Vlieger_, Jul 18 2017 *)

%o (PARI) lista(nn) = {for (n=2, nn, f = factor(n); if ((#f~ != 1) && (type(q=sum(k=1, #f~, f[k,1])/#f~) == "t_INT") && isprime(q), print1(n, ", ")););} \\ _Michel Marcus_, Mar 28 2015

%Y Cf. A001414, A008472, A070005.

%K easy,nonn

%O 1,1

%A _Labos Elemer_, Apr 11 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 07:07 EDT 2021. Contains 347673 sequences. (Running on oeis4.)