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!)
A216161 [11^(5*10^n) mod 10^(2n+2) - 1]/(10^(2n+1)) mod 10. 1

%I #10 Jan 04 2013 23:01:57

%S 3,2,2,4,3,5,7,3,1,7,0,4,4,1,2,6,3,4,1,7,7,1,0,9,6,8,4,3,6,1,8,3,1,4,

%T 6,5,9,1,9,8,2,2,1,4,3,5,5,5,3,3,9,9,0,9,1,4,8,1,5,8,2,6,9,6,7,6,6,3,

%U 6,9,9,2,9,2,4,2,4,9,3,3,1,2,8,4,9,6,7,5,5,1,5,8,9,6,7,1,1,2,6,6,0,9,4,4,2,9

%N [11^(5*10^n) mod 10^(2n+2) - 1]/(10^(2n+1)) mod 10.

%C 11^50 ends in 23001

%C 11^500 ends in 2230001

%C 11^5000 ends in 422300001

%C 11^50000 ends in 34223000001

%C The last digits before the zeros converge to this sequence.

%Y Cf. A007185, A016090, A091663, A018248, A091664, A018247.

%Y A216159 gives 10's-complement.

%K nonn,base

%O 1,1

%A _V. Raman_, Sep 02 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 August 15 05:59 EDT 2024. Contains 375172 sequences. (Running on oeis4.)