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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216103 [3^(5*10^(n+1)) mod 10^(2n+3) - 1]/(10^(2n+2)) mod 10. 1

%I

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

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

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

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

%C 3^500 ends in 7610001

%C 3^5000 ends in 276100001

%C 3^50000 ends in 32761000001

%C 3^500000 ends in 9327610000001

%C The last digits before the zeros are converging to the present sequence.

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

%Y A216102 gives the 10's-complement.

%K nonn,base

%O 1,2

%A _V. Raman_, Sep 01 2012

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 June 23 23:39 EDT 2021. Contains 345403 sequences. (Running on oeis4.)