A048685 Consider number of prime divisors counted with multiplicity (A001222). Apply this function to C(n,k)'s. Find maximum and count its occurrence.

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

Offset

1,1

Links

Table of n, a(n) for n=1..102.

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: A366770 A355249 A337618 * A364663 A101050 A128979

Adjacent sequences: A048682 A048683 A048684 * A048686 A048687 A048688

Keyword

nonn

Author

Labos Elemer

Status

approved