Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059392
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
1, 2, 9, 44, 72125, 759114, 461821904 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A059333, A059363.

Sequence in context: A073478 A088369 A059388 this_sequence A074607 A036726 A020053

Adjacent sequences: A059389 A059390 A059391 this_sequence A059393 A059394 A059395

KEYWORD

hard,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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research