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

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

Offset

1,2

Comments

3^500 ends in 7610001

3^5000 ends in 276100001

3^50000 ends in 32761000001

3^500000 ends in 9327610000001

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

Links

Table of n, a(n) for n=1..96.

Crossrefs

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

A216102 gives the 10's-complement.

Sequence in context: A021941 A171654 A197916 * A198823 A353053 A219733

Adjacent sequences: A216100 A216101 A216102 * A216104 A216105 A216106

Keyword

nonn,base

Author

V. Raman, Sep 01 2012

Status

approved