|
|
A357327
|
|
a(n) is the unique nonnegative integer k <= A058084(n)/2 such that binomial(A058084(n),k) = n.
|
|
2
|
|
|
0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The first occurrence of 6 in Pascal's triangle is in row 4 = A058084(6) and binomial(4,2) = 6, so a(6) = 2.
|
|
PROG
|
(PARI) a(n) = my(k=0); while (!vecsearch(vector((k+2)\2, i, binomial(k, i-1)), n), k++); select(x->(x==n), vector((k+2)\2, i, binomial(k, i-1)), 1)[1] - 1; \\ Michel Marcus, Sep 24 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|