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”).

A086707
Smallest mode of the sequences n/(n-k)*binomial(n,n-k) (see link).
0
0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22
OFFSET
1,6
LINKS
Moussa Benoumhani, A Sequence of Binomial Coefficients Related to Lucas and Fibonacci Numbers, J. Integer Seqs., Vol. 6, 2003, Article 03.2.1.
FORMULA
a(n) = ceiling(1/10*(5*n-4-sqrt(5*n^2-4))).
MATHEMATICA
Table[Ceiling[1/10 (5 n - 4 - Sqrt[5 n^2 - 4])], {n, 1, 100}] (* Vincenzo Librandi, May 21 2015 *)
PROG
(PARI) vector(80, n, ceil(1/10*(5*n-4-sqrt(5*n^2-4)))) \\ Michel Marcus, May 20 2015
(Magma) [Ceiling(1/10*(5*n-4-Sqrt(5*n^2-4))): n in [1..100]]; // Vincenzo Librandi, May 21 2015
CROSSREFS
Sequence in context: A274024 A285189 A051889 * A217538 A333348 A194920
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jul 28 2003
STATUS
approved