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

%I #42 Feb 20 2019 09:56:29

%S 1,0,0,3,0,1,3,0,8,9,0,11,0,0,14,0,0,0,0,0,0,0,0,23,21,0,0,0,0,29,30,

%T 0,0,0,0,0,4,0,3,0,0,0,0,0,22,3,0,0,48,0,2,17,0,0,54,0,56,0,0,0,11,0,

%U 0,21,0,65,9,0,4,23,0,3,0,0,74,0,0,0,39,0,33,0

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

%H V. Raman, <a href="/A216416/b216416.txt">Table of n, a(n) for n = 1..99</a>.

%o (PARI) for(i=0,200,i++;m=0;for(x=1,i,if(((10^x+1))%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 23 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)