Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112723
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112723 a(n) is the smallest number m such that the first n primes is the set of all distinct prime divisors of m and for i=1, 2,...,n prime(i)*m-1 is prime. +0
4
2, 6, 30, 420, 2587200, 6787314293760 (list; graph; listen)
OFFSET

1,1

LINKS

Carlos Rivera, The Prime Puzzles & Problems connection.

EXAMPLE

a(6)=6787314293760 because {2,3,5,7,11,13}={prime(1),prime(2),..., prime(6)} is the set of prime factors of 6787314293760,

all six numbers 2*6787314293760-1,3*6787314293760-1, 5*6787314293760-1,7*6787314293760-1,11*6787314293760-1 & 13*6787314293760-1 are prime and 6787314293760 is the first number with such properties.

CROSSREFS

Cf. A092023, A092024.

Adjacent sequences: A112720 A112721 A112722 this_sequence A112724 A112725 A112726

Sequence in context: A001684 A076926 A092023 this_sequence A074777 A007280 A102927

KEYWORD

hard,nonn

AUTHOR

Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Nov 05 2005

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 October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research