A022911 Arrange the nontrivial binomial coefficients C(m,k) (2 <= k <= m/2) in increasing order (not removing duplicates); record the sequence of m's.

4, 5, 6, 6, 7, 8, 7, 9, 10, 11, 8, 12, 8, 13, 9, 14, 15, 16, 10, 9, 17, 18, 11, 19, 20, 21, 10, 12, 22, 10, 23, 24, 13, 25, 26, 11, 27, 14, 28, 29, 30, 15, 11, 31, 12, 32, 33, 16, 34, 35, 36, 37, 17, 38, 13, 39, 40, 12, 18, 41, 42, 43, 12, 44, 19, 45, 14, 46, 47, 48

Offset: 1

Author

Clark Kimberling

Keywords

• nonn

Comments

In case of duplicates, the m values are listed in decreasing order. Thus a(18)=16 and a(19)=10 corresponding to binomial(16,2)=binomial(10,3)=120. - Robert Israel, Sep 18 2018

Links

• Robert Israel, Table of n, a(n) for n = 1..10000
• Sean A. Irvine, Java program (github)

Crossrefs

Cf. A003015, A006987, A022912, A319382.

Programs

Maple

N:= 10000: # for binomial(n,k) values <= N
Res:= NULL:
for n from 2 while n*(n-1)/2 <= N do
  for k from 2 to n/2 do
    v:= binomial(n,k);
    if v > N then break fi;
    Res:= Res,[v,n,k]
od od:
Res:= sort([Res],proc(p,q) if p[1]<>q[1] then  p[1]q[2] then p[2]>q[2]
  fi end proc):
map(t -> t[2], Res); # Robert Israel, Sep 18 2018

Formula

A319382(n) = binomial(a(n),A022912(n)). - Robert Israel, Sep 18 2018