Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059391
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
4, 27, 208, 18630 (list; graph; listen)
OFFSET

1,1

COMMENT

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

CROSSREFS

Cf. A059333. A059363.

Sequence in context: A091125 A091121 A026005 this_sequence A161120 A121063 A051863

Adjacent sequences: A059388 A059389 A059390 this_sequence A059392 A059393 A059394

KEYWORD

hard,more,nonn

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jan 29 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research