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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100576 Smallest difference between distinct prime divisors of the n-th non-prime-power. 2
 1, 3, 1, 5, 2, 1, 3, 4, 9, 1, 11, 5, 1, 8, 15, 2, 1, 17, 10, 3, 1, 9, 2, 21, 1, 3, 14, 11, 1, 6, 5, 16, 27, 1, 29, 4, 8, 1, 15, 20, 2, 1, 35, 2, 17, 4, 1, 3, 39, 1, 12, 41, 26, 9, 1, 6, 21, 28, 45, 14, 1, 5, 8, 3, 1, 11, 2, 51, 1, 3, 34, 5, 1, 18, 27, 10, 57, 10, 1, 59, 38, 29, 1, 40, 3, 1, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 EXAMPLE 6 is the first non-prime-power. Since 6 = 2*3 and 3-2 = 1, then a(1) = 1. MATHEMATICA Min[Differences[FactorInteger[#][[All, 1]]]]&/@ Select[Range[ 2, 150], !PrimePowerQ[ #]&] (* Harvey P. Dale, Jun 22 2021 *) CROSSREFS Sequence in context: A176249 A083722 A111426 * A212332 A131032 A130323 Adjacent sequences: A100573 A100574 A100575 * A100577 A100578 A100579 KEYWORD nonn AUTHOR Leroy Quet, Jan 02 2005 EXTENSIONS More terms from Franklin T. Adams-Watters, Aug 29 2006 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 February 5 08:15 EST 2023. Contains 360082 sequences. (Running on oeis4.)