Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093553 a(n) is the smallest number m such that (m+k-1)/k is prime for k=1,2,...,n. +0
3
2, 3, 13, 12721, 19441, 5516281, 5516281, 7321991041, 363500177041, 2394196081201 (list; graph; listen)
OFFSET

1,1

COMMENT

This sequence is A074200 + 1. See that entry for more information and further terms. - N. J. A. Sloane, May 04 2009

It is obvious that this sequence is increasing and each term is prime. If n>3 then a(n)==1 (mod 10).

EXAMPLE

a(9)=363500177041 because all the nine numbers 363500177041,

(363500177041+1)/2, (363500177041+2)/3, (363500177041+3)/4,

(363500177041+4)/5, (363500177041+5)/6, (363500177041+6)/7,

(363500177041+7)/8 and (363500177041+8)/9 are primes and

363500177041 is the smallest number m such that (m+k-1)/k is prime for k=1,2,...,9.

CROSSREFS

Cf. A072875.

Sequence in context: A160858 A062648 A094003 this_sequence A027673 A119616 A056435

Adjacent sequences: A093550 A093551 A093552 this_sequence A093554 A093555 A093556

KEYWORD

more,nonn

AUTHOR

Farideh Firoozbakht (mymontain(AT)yahoo.com), Apr 14 2004

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research