|
%I #7 Jun 25 2012 06:07:57
%S 14,15,35,39,51,95,115,87,155,111,123,215,235,159,371,183,302,335,219,
%T 511,395,415,267,623,291,303,482,327,339,791,554,1415,635,655,411,695,
%U 662,447,698,471,734,815,835,519,1211,543,842,1991,579,591,914,2167
%N Smallest number k such that the sum of the distinct prime divisors of k equals n times a square > 1.
%C Smallest k such that sopf(k) = n*q where q is a square.
%H Michel Lagneau, <a href="/A213386/b213386.txt">Table of n, a(n) for n = 1..1000</a>
%e a(55) = 2631 because 2631 = 3*877 and 3 + 877 = 880 = 55*16 where 16 is a square.
%p with (numtheory):
%p sopf:= proc(n) option remember;
%p add(i, i=factorset(n))
%p end:
%p a:= proc(n) local k, p;
%p for k from 2 while irem(sopf(k), n, 'p')>0 or
%p sqrt(p)<>floor(sqrt(p)) or p=1 do od; k
%p end:
%p seq (a(n), n=1..100);
%Y Cf. A008492, A213420.
%K nonn
%O 1,1
%A _Michel Lagneau_, Jun 10 2012
|
