login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A319500
a(n) is the least m for which A006987(n) = binomial(m,k) for some k, 2 <= k <= m/2.
2
4, 5, 6, 6, 7, 8, 7, 9, 10, 11, 8, 12, 8, 13, 9, 14, 15, 10, 9, 17, 18, 11, 19, 20, 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, 20, 49, 50, 51, 13, 52, 21, 15, 53
OFFSET
1,1
COMMENTS
First differs from A022911 at n=18.
LINKS
FORMULA
A006987(n) = binomial(a(n),A318955(n)).
EXAMPLE
a(3) = 6 because A006987(3) = 15 = binomial(6,2).
MAPLE
N:= 10000: # for binomial(n, k) values <= N
S:= {}:
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;
if not member(v, S) then
S:= S union {v};
M[v]:= n;
fi
od od:
A006987:= sort(convert(S, list)):
seq(M[A006987[i]], i=1..nops(A006987));
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Sep 20 2018
STATUS
approved