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!)
 A048685 Consider number of prime divisors counted with multiplicity (A001222). Apply this function to C(n,k)'s. Find maximum and count its occurrence. 0
 2, 1, 2, 3, 2, 1, 4, 2, 6, 3, 4, 2, 2, 1, 2, 4, 4, 2, 8, 2, 2, 3, 8, 2, 2, 3, 2, 3, 2, 1, 2, 4, 2, 4, 8, 2, 2, 2, 12, 2, 6, 2, 2, 2, 2, 1, 2, 2, 2, 4, 8, 2, 4, 2, 4, 2, 2, 5, 4, 2, 4, 1, 18, 2, 8, 2, 2, 10, 8, 2, 2, 6, 2, 2, 2, 2, 4, 2, 10, 8, 4, 4, 2, 6, 2, 3, 2, 2, 4, 2, 2, 2, 2, 1, 2, 4, 4, 2, 4, 2, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE n=19, the A001222 spectrum for binomials C(n,k) is: {0,1,3,3,5,6,6,6,6,5,5,6,6,6,6,5,3,3,1,0}. The maximum arises 8 times, so a(19)=8. CROSSREFS A000005, A001221, A001222, A007947, A020738, A020733. Sequence in context: A134388 A055095 A337618 * A101050 A128979 A332509 Adjacent sequences:  A048682 A048683 A048684 * A048686 A048687 A048688 KEYWORD nonn AUTHOR 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 July 25 10:05 EDT 2021. Contains 346289 sequences. (Running on oeis4.)