cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A060065 Smallest mode of the sequence { C(n-k,k), k=0..n/2 }.

This page as a plain text file.
%I A060065 #16 Apr 18 2019 04:50:06
%S A060065 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,
%T A060065 9,10,10,10,10,11,11,11,12,12,12,12,13,13,13,14,14,14,14,15,15,15,15,
%U A060065 16,16,16,17,17,17,17,18,18,18,18,19,19,19,20,20,20
%N A060065 Smallest mode of the sequence { C(n-k,k), k=0..n/2 }.
%H A060065 S. M. Tanny and M. Zuker, <a href="http://dx.doi.org/10.1016/0012-365X(74)90073-9">On a unimodal sequence of binomial coefficients</a>, Discrete Math. 9 (1974), 79-89.
%p A060065 A060065 := n->ceil( (5*n-3-sqrt(5*n^2+10*n+9))/10);
%o A060065 (PARI) a(n)=(5*n-sqrtint(5*n^2+10*n+9)+6)\10 \\ _Charles R Greathouse IV_, Sep 22 2016
%Y A060065 Cf. A073028.
%K A060065 nonn
%O A060065 0,7
%A A060065 _N. J. A. Sloane_, Apr 10 2001