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!)
 A019491 Numbers n for which number of distinct prime divisors of binomial(n,k) has local minimum at k = n/2. 3
 10, 20, 27, 28, 29, 34, 38, 44, 45, 46, 51, 52, 53, 54, 60, 61, 62, 69, 70, 74, 77, 78, 79, 81, 82, 87, 88, 92, 93, 94, 95, 101, 102, 103, 104, 105, 106, 110, 111, 112, 113, 114, 115, 116, 117, 118, 120, 122, 124, 125, 126, 127, 130, 138, 139, 140 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 EXAMPLE If n=28 then {r(C(28,k))}={0,2,3,4,4,5,6,6,6,7,8,7,7,7,6,7,7,7,8,7,6,6,6,5,4,4,3,2,0}. Thus r(C(28,14))=6 is local minimum, while r(C(28,10))=8 is maximum. MATHEMATICA Select[Range[140], MatchQ[PrimeNu[Binomial[#, Range[Floor[#/2], #]]], {(x_) .., y_, ___} /; x < y]&] (* Jean-François Alcover, Dec 10 2016 *) CROSSREFS Cf. A048484, A048486, A001221, A020731. Sequence in context: A229304 A101869 A015872 * A249989 A175229 A242964 Adjacent sequences:  A019488 A019489 A019490 * A019492 A019493 A019494 KEYWORD nonn AUTHOR EXTENSIONS Data corrected by Jean-François Alcover, Dec 10 2016 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 November 30 08:16 EST 2021. Contains 349419 sequences. (Running on oeis4.)