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!)
A216103 [3^(5*10^(n+1)) mod 10^(2n+3) - 1]/(10^(2n+2)) mod 10. 1
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 (list; graph; refs; listen; history; text; internal format)
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
CROSSREFS
A216102 gives the 10's-complement.
Sequence in context: A021941 A171654 A197916 * A198823 A353053 A219733
KEYWORD
nonn,base
AUTHOR
V. Raman, Sep 01 2012
STATUS
approved

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 March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)