login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059363 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 a (k(i)+A)-almost prime for i = 1, ..., n-1. 2
1, 2, 25, 745, 2306, 7081, 31945, 435866, 716881, 733442, 4106917, 21714577 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

The values of k(n) are 0,1,2,2,2,... and are conjectured to be 2 for all n > 2.

CROSSREFS

Cf. A059333.

Sequence in context: A090733 A197084 A119829 * A014050 A015214 A204234

Adjacent sequences:  A059360 A059361 A059362 * A059364 A059365 A059366

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:23 EST 2012. Contains 205907 sequences.