Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A031442
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A031442 a(0) = 13; for n > 0, a(n) is the greatest prime factor of PreviousPrime(a(n-1))*a(n-1)-1 where PreviousPrime(prime(k))=prime(k-1). +0
5
13, 71, 41, 379, 23561, 5431, 20269, 89, 1231, 44497, 329952671, 36583, 1126159, 90209117, 14095897, 15272393, 13887359, 256460794943, 2740505805180429880723, 1591234463080874838018721796071210709 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Cf. A031441.

Sequence in context: A085461 A081860 A050403 this_sequence A066831 A067382 A128003

Adjacent sequences: A031439 A031440 A031441 this_sequence A031443 A031444 A031445

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp)

EXTENSIONS

More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), May 23 2000. a(19) and a(20) are strong pseudoprimes to many bases.

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research