|
%I #3 Mar 31 2012 13:50:36
%S 1,2,9,44,72125,759114,461821904
%N a(1)=1; 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 a(i)+m is an (abs[ A-k(i) ])-almost prime for i = 1,2,3,..,n-1.
%Y Cf. A059333, A059363.
%K hard,nonn
%O 1,2
%A _Naohiro Nomoto_, Jan 29 2001
|
