|
%I #3 Mar 31 2012 13:50:36
%S 2,4,27,392,591250
%N a(1)=2, a(n) is a k(n)-almost prime; m is an A-almost prime (for 1 < A); a(n) = smallest number m>a(n-1) such that m-a(i) is a (A-k(i))-almost prime for i = 1,..,n-1.
%Y Cf. A059391.
%K more,nonn
%O 1,1
%A _Naohiro Nomoto_, Feb 08 2001
|
