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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059392 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. 1
1, 2, 9, 44, 72125, 759114, 461821904 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..7.

CROSSREFS

Cf. A059333, A059363.

Sequence in context: A088369 A303938 A059388 * A264111 A264122 A233505

Adjacent sequences:  A059389 A059390 A059391 * A059393 A059394 A059395

KEYWORD

hard,nonn

AUTHOR

Naohiro Nomoto, Jan 29 2001

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 5 20:15 EDT 2020. Contains 333260 sequences. (Running on oeis4.)