Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059363
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
3
1, 2, 25, 745, 2306, 7081, 31945, 435866, 716881, 733442, 4106917, 21714577 (list; graph; listen)
OFFSET

1,2

COMMENT

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: A121252 A090733 A119829 this_sequence A014050 A015214 A088816

Adjacent sequences: A059360 A059361 A059362 this_sequence A059364 A059365 A059366

KEYWORD

nonn

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jan 28 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research