cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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

Views

Author

V. Raman, Sep 01 2012

Keywords

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.

Crossrefs

Cf. A007185, A016090, A091663, A018248, A091664, A018247.
A216102 gives the 10's-complement.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.