login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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). 5
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; text; internal format)
OFFSET

0,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..1000

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.

MATHEMATICA

a[0] = 3; a[n_] := a[n] = FactorInteger[ NextPrime[ a[n-1], -1]*a[n-1] - 1][[-1, 1]]; Table[a[n], {n, 0, 66}] (* Jean-Fran├žois Alcover, Mar 09 2012 *)

NestList[FactorInteger[NextPrime[#, -1]*#-1][[-1, 1]]&, 3, 70] (* Harvey P. Dale, Dec 13 2012 *)

CROSSREFS

Cf. A034970, A031442.

Sequence in context: A078683 A099863 A112092 * A078150 A276044 A114265

Adjacent sequences:  A031438 A031439 A031440 * A031442 A031443 A031444

KEYWORD

nonn,easy,nice

AUTHOR

Yasutoshi Kohmoto

EXTENSIONS

More terms from James A. Sellers

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 28 08:20 EST 2020. Contains 332321 sequences. (Running on oeis4.)