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!)
A216470 a(n) = smallest m such that 2n-1 | (10^m+1)/11, or 0 if no such m exists. 0

%I #82 Aug 19 2016 00:28:00

%S 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,

%T 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,

%U 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

%N a(n) = smallest m such that 2n-1 | (10^m+1)/11, or 0 if no such m exists.

%o (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

%Y Cf. A002326.

%K nonn

%O 1,4

%A _V. Raman_, Sep 07 2012

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 25 09:38 EDT 2024. Contains 371967 sequences. (Running on oeis4.)