The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 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
 3, 6, 10, 14, 19, 23, 27, 31, 36, 40, 44, 49, 53, 57, 62, 66, 70, 75, 79, 83, 88, 92, 96, 101, 105, 109, 114, 118, 122, 127, 131, 136, 140, 144, 149, 153, 157, 162, 166, 171, 175, 179, 184, 188, 192, 197, 201, 206, 210, 214, 219, 223, 227, 232, 236, 241, 245 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The values of a(1)-a(10) are given in the paper by Woodford. LINKS Felix Fröhlich, Table of n, a(n) for n = 1..2000 R. Woodford, A Variation on Perfect Numbers, Integers: Electronic Journal of Combinatorial Number Theory, Vol. 4, A11 (2004). PROG (PARI) a(n) = r=n; while(binomial(r, n) >= 2^(r-n), r++); r CROSSREFS Sequence in context: A310066 A310067 A310068 * A310069 A310070 A036572 Adjacent sequences:  A259643 A259644 A259645 * A259647 A259648 A259649 KEYWORD nonn AUTHOR Felix Fröhlich, Jul 15 2015 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.

Last modified December 5 06:51 EST 2020. Contains 338944 sequences. (Running on oeis4.)