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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A199970 a(n) = the smallest number m with the smallest non-divisor n such that 1
 0, 3, 4, 6, 12, 0, 60, 420, 840, 0, 2520, 0, 27720, 0, 0, 360360, 720720, 0, 12252240, 0, 0, 0, 232792560, 0, 5354228880, 0, 26771144400, 0, 80313433200, 0, 2329089562800, 72201776446800, 0, 0, 0, 0, 144403552893600, 0, 0, 0, 5342931457063200, 0, 219060189739591200 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..43. FORMULA a(n) > 0 for prime powers n = p^k (p prime, k >= 1) else 0. a(n) = A003418(n-1) for n = p^k > 3 (p prime, k >= 1). - Amiram Eldar, Aug 06 2024 EXAMPLE a(7) = 60 because 60 is the smallest number such that numbers k < 7 divides 60 but number 7 is not divisor of 60. MATHEMATICA a[n_] := If[PrimePowerQ[n], If[n <= 3, n+1, LCM @@ Range[n-1]], 0]; Array[a, 50] (* Amiram Eldar, Aug 06 2024 *) CROSSREFS Cf. A003418, A199968, A199969. Sequence in context: A192813 A048229 A002090 * A283738 A366535 A368469 Adjacent sequences: A199967 A199968 A199969 * A199971 A199972 A199973 KEYWORD nonn AUTHOR Jaroslav Krizek, Nov 26 2011 EXTENSIONS More terms from Amiram Eldar, Aug 06 2024 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 September 12 05:07 EDT 2024. Contains 375842 sequences. (Running on oeis4.)