login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A259646 Values of r(k): the smallest r such that binomial(r, k) < 2^{r-k}. 1

%I #45 Jul 15 2015 21:46:23

%S 3,6,10,14,19,23,27,31,36,40,44,49,53,57,62,66,70,75,79,83,88,92,96,

%T 101,105,109,114,118,122,127,131,136,140,144,149,153,157,162,166,171,

%U 175,179,184,188,192,197,201,206,210,214,219,223,227,232,236,241,245

%N Values of r(k): the smallest r such that binomial(r, k) < 2^{r-k}.

%C The values of a(1)-a(10) are given in the paper by Woodford.

%H Felix Fröhlich, <a href="/A259646/b259646.txt">Table of n, a(n) for n = 1..2000</a>

%H R. Woodford, <a href="http://www.emis.de/journals/INTEGERS/papers/e11/e11.Abstract.html">A Variation on Perfect Numbers</a>, Integers: Electronic Journal of Combinatorial Number Theory, Vol. 4, A11 (2004).

%o (PARI) a(n) = r=n; while(binomial(r, n) >= 2^(r-n), r++); r

%K nonn

%O 1,1

%A _Felix Fröhlich_, Jul 15 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 08:13 EDT 2024. Contains 371922 sequences. (Running on oeis4.)