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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135093 Least composite number k for each possible difference gpf(k)-lpf(k). 3
 4, 6, 15, 10, 21, 14, 55, 33, 22, 39, 26, 85, 51, 34, 57, 38, 115, 69, 46, 203, 145, 87, 58, 93, 62, 259, 185, 111, 74, 205, 123, 82, 129, 86, 235, 141, 94, 371, 265, 159, 106, 413, 295, 177, 118, 183, 122, 469, 335, 201, 134, 355, 213, 142, 219, 146, 553, 395, 237 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Clearly all terms are semiprimes. a(0)=prime(1)^2=4. For n>=1, a(n)=k, a squarefree semiprime, where gpf(k)-lpf(k)=A006530(k)-A020639(k)=A030173(k). For n > 0: first occurrences of A030173(n) in A046665. - Reinhard Zumkeller, Jul 03 2015 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 EXAMPLE a(3)=2*5=10 because 5-2=3=A030173(3), where the latter terms are ordered by the increasing possible differences between two distinct primes and no smaller composite number has a difference of 3 between its least and greatest prime factors. PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a135093 0 = 4 a135093 n = (+ 1) \$ fromJust \$ (`elemIndex` a046665_list) \$ a030173 n -- Reinhard Zumkeller, Jul 03 2015 CROSSREFS Cf. A001358, A006881, A030173, A020639, A006530. Cf. A046665. Sequence in context: A114058 A214901 A284123 * A141667 A048753 A055719 Adjacent sequences:  A135090 A135091 A135092 * A135094 A135095 A135096 KEYWORD nonn AUTHOR Rick L. Shepherd, Nov 18 2007 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 August 4 08:20 EDT 2020. Contains 336201 sequences. (Running on oeis4.)