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!)
A059391 a(1)=4; 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 a (A-k(i))-almost prime for i = 1,2,3,..,n-1. 1
4, 27, 208, 18630 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Conjecture: k(n)= n-th prime (conjectured by Naohiro Nomoto). The next new term is bigger than 5*10^7.

LINKS

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

CROSSREFS

Cf. A059333. A059363.

Sequence in context: A193221 A091121 A026005 * A190738 A275607 A319518

Adjacent sequences:  A059388 A059389 A059390 * A059392 A059393 A059394

KEYWORD

hard,more,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 8 02:18 EDT 2020. Contains 333312 sequences. (Running on oeis4.)