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!)
 A251618 Smallest term in A098550 having prime(n) as a factor. 3
 2, 3, 15, 14, 22, 39, 51, 38, 69, 87, 62, 74, 123, 86, 94, 106, 118, 122, 201, 142, 146, 158, 249, 178, 291, 202, 206, 214, 218, 226, 254, 262, 274, 278, 298, 302, 314, 326, 334, 346, 358, 362, 382, 386, 394, 398, 422, 446, 454, 458, 466, 478, 482, 502, 514 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Largest prime factor of a(n) = prime(n); a(n) is composite for n > 2; first column in A251637; conjecture: for n > 2: a(n) = 2*prime(n) or a(n) = 3*prime(n); conjecture: for n > 25: a(n) = 2*prime(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 PROG (Haskell) import Data.List (find); import Data.Maybe (fromJust) a251618 n = fromJust \$             find (\x -> mod x (fromIntegral \$ a000040 n) == 0) a098550_list CROSSREFS Cf. A098550, A000040, A251637, A251619 (smallest prime factor), A006530. Sequence in context: A075244 A088030 A101047 * A309765 A238691 A241721 Adjacent sequences:  A251615 A251616 A251617 * A251619 A251620 A251621 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 07 2014 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 October 28 21:20 EDT 2020. Contains 338064 sequences. (Running on oeis4.)