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.

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

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

V. Raman, Sep 02 2012

Keywords

Comments

11^50 ends in 23001
11^500 ends in 2230001
11^5000 ends in 422300001
11^50000 ends in 34223000001
The last digits before the zeros converge to this sequence.

Crossrefs

Cf. A007185, A016090, A091663, A018248, A091664, A018247.
A216159 gives 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.