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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216470 a(n) = smallest m such that 2n-1 | (10^m+1)/11, or 0 if no such m exists. 0
 1, 0, 0, 3, 0, 11, 3, 0, 0, 9, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23, 21, 0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, 121, 0, 0, 21, 0, 65, 9, 0, 0, 23, 0, 33, 0, 0, 0, 0, 0, 0, 39, 0, 33, 0, 0, 83, 39, 0, 0, 0, 0, 89, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS PROG (PARI) for(i=0, 200, i++; m=0; for(x=0, i, x++; if(((10^x+1)/11)%i==0, m=x; break)); print1(m", ")) \\ V. Raman, Nov 22 2012 CROSSREFS Cf. A002326. Sequence in context: A094897 A252096 A346240 * A182259 A211802 A249775 Adjacent sequences:  A216467 A216468 A216469 * A216471 A216472 A216473 KEYWORD nonn AUTHOR V. Raman, Sep 07 2012 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 9 08:41 EST 2021. Contains 349627 sequences. (Running on oeis4.)