This site is supported by donations to The OEIS Foundation.

 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!)
 A251738 Smallest k such that n * sum(i=0..k, binomial(k,i) mod (n-1) ) < 2^n. 2
 1, 4, 6, 6, 5, 8, 7, 8, 9, 10, 10, 9, 10, 10, 10, 11, 11, 11, 12, 11, 12, 11, 11, 12, 13, 12, 11, 13, 12, 13, 13, 13, 12, 13, 13, 14, 13, 14, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 14, 14, 15, 14, 15, 15, 15, 15, 16, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS Aside from the third value, the sequence is the same as A251739. LINKS EXAMPLE For n = 3, 3 * sum(i=0..1, binomial(1,i) mod 2) = 3 * (1 + 1) = 6 >= 2^1, 3 * sum(i=0..2, binomial(2,i) mod 2) = 3 * (1 + 0 + 1) = 6 >= 2^2, 3 * sum(i=0..3, binomial(3,i) mod 2) = 3 * (1 + 1 + 1 + 1) = 12 >= 2^3, 3 * sum(i=0..4, binomial(4,i) mod 2) = 3 * (1 + 0 + 0 + 0 + 1) = 6 < 2^4,so A251738(3) = 4. CROSSREFS Cf. A251739. Sequence in context: A011227 A155907 A081261 * A249022 A270541 A046262 Adjacent sequences:  A251735 A251736 A251737 * A251739 A251740 A251741 KEYWORD nonn AUTHOR Jens Voß, Dec 07 2014 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 10:45 EST 2019. Contains 329751 sequences. (Running on oeis4.)