login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059719 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. 0

%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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 19:44 EDT 2024. Contains 373690 sequences. (Running on oeis4.)