The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100481 Greatest prime factor in A095117(n). 0
 1, 3, 5, 3, 2, 3, 11, 3, 13, 7, 2, 17, 19, 5, 7, 11, 3, 5, 3, 7, 29, 5, 2, 11, 17, 7, 3, 37, 13, 5, 7, 43, 11, 5, 23, 47, 7, 5, 17, 13, 3, 11, 19, 29, 59, 5, 31, 7, 2, 13, 11, 67, 23, 7, 71, 3, 73, 37, 19, 11, 79, 5, 3, 41, 83, 7, 43, 29, 11, 89, 13, 23, 47, 19, 3, 97, 7, 11, 101, 17, 103 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Conjecture: every prime appears infinitely often in this sequence. LINKS FORMULA a(n) = A006530(n + A000720(n)). PROG (PARI) gpf(n) = if (n==1, 1, vecmax(factor(n)[, 1])); a(n) = gpf(n + primepi(n)); \\ Michel Marcus, Feb 24 2023 CROSSREFS Cf. A000720, A006530, A095117. Sequence in context: A357469 A245509 A085849 * A205009 A101778 A292570 Adjacent sequences: A100478 A100479 A100480 * A100482 A100483 A100484 KEYWORD easy,nonn,less AUTHOR Jonathan Vos Post, Nov 22 2004 EXTENSIONS Extended by Ray Chandler, Nov 27 2004 STATUS approved

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

Last modified March 30 10:19 EDT 2023. Contains 361609 sequences. (Running on oeis4.)