Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082132
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082132 a(0) = 5; for n > 0, a(n) is the greatest prime factor of PP(a(n-1))*a(n-1)-2 where PP(n) is an abbreviation for PreviousPrime(n). +0
2
5, 13, 47, 673, 1093, 4789, 15887, 6961, 7079, 1853387, 5636791, 16319158451, 46975091221, 97536826417, 9513432505744326182381, 2335222008886384800739, 7440517660385876970522347503153, 83914607657246408236765553419 (list; graph; listen)
OFFSET

0,1

COMMENT

Some of the larger entries may only correspond to probable primes.

PROGRAM

(PARI) p=5; for(k=1, 20, print1(p, ", "); p=precprime(p-1)*p-2; f=factor(p); s=matsize(f)[1]; p=f[s, 1]) (Shepherd)

CROSSREFS

Cf. A082021, A031441, A031442.

Sequence in context: A060050 A120790 A025545 this_sequence A138277 A084601 A007231

Adjacent sequences: A082129 A082130 A082131 this_sequence A082133 A082134 A082135

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), May 10 2003

EXTENSIONS

Edited by Rick L. Shepherd (rshepherd2(AT)hotmail.com), Dec 19 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research