login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060065 Smallest mode of the sequence { C(n-k,k), k=0..n/2 }. 2
0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 20, 20, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

LINKS

Table of n, a(n) for n=0..73.

S. M. Tanny and M. Zuker, On a unimodal sequence of binomial coefficients, Discrete Math. 9 (1974), 79-89.

MAPLE

A060065 := n->ceil( (5*n-3-sqrt(5*n^2+10*n+9))/10);

PROG

(PARI) a(n)=(5*n-sqrtint(5*n^2+10*n+9)+6)\10 \\ Charles R Greathouse IV, Sep 22 2016

CROSSREFS

Cf. A073028.

Sequence in context: A316626 A269734 A066927 * A057356 A172274 A183138

Adjacent sequences:  A060062 A060063 A060064 * A060066 A060067 A060068

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Apr 10 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 04:05 EST 2019. Contains 330013 sequences. (Running on oeis4.)