login
This site is supported by donations to The OEIS 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; internal format)
OFFSET

1,2

CROSSREFS

Cf. A059333, A059363.

Sequence in context: A073478 A088369 A059388 * A074607 A162725 A168431

Adjacent sequences:  A059389 A059390 A059391 * A059393 A059394 A059395

KEYWORD

hard,nonn

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jan 29 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 01:56 EST 2012. Contains 205860 sequences.