The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024709 Least prime divisor of A024702(n). 1
 2, 5, 7, 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 5, 5, 11, 2, 2, 2, 7, 2, 2, 5, 2, 3, 3, 2, 2, 5, 2, 5, 5, 2, 13, 3, 2, 29, 3, 3, 2, 2, 3, 2, 5, 2, 19, 5, 2, 2, 2, 3, 2, 2, 3, 2, 23, 2, 47, 7, 3, 2, 2, 53, 5, 2, 29, 5, 2, 2, 2, 11, 3, 2, 5, 3, 2, 2, 5, 5, 2, 2, 2, 13, 2, 2, 5, 2, 3, 2, 2, 5, 5, 2, 5, 2, 3, 3, 7, 3, 47, 2, 5, 2, 7, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,1 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 4..10000 PROG (PARI) a(n)=factor(prime(n)^2\24)[1, 1] \\ Charles R Greathouse IV, May 30 2013 CROSSREFS Sequence in context: A010589 A024715 A296479 * A101245 A004576 A093200 Adjacent sequences:  A024706 A024707 A024708 * A024710 A024711 A024712 KEYWORD nonn AUTHOR 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.

Last modified December 1 16:44 EST 2021. Contains 349430 sequences. (Running on oeis4.)