login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A031441 a(0) = 3; 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). 4
3, 5, 7, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23, 109, 17, 11, 19, 23 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

EXAMPLE

To get a(3) we compute PreviousPrime(7)=5, 5*7-1=34, greatest prime factor of 34 is 17, so a(3)=17.

CROSSREFS

Cf. A034970, A031442.

Sequence in context: A078683 A099863 A112092 * A078150 A114265 A110358

Adjacent sequences:  A031438 A031439 A031440 * A031442 A031443 A031444

KEYWORD

nonn,easy,nice

AUTHOR

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

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 17:35 EST 2012. Contains 206061 sequences.