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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216092 a(n) = 2^(2*5^(n-1)) mod 10^n. 5
4, 24, 624, 624, 90624, 890624, 2890624, 12890624, 212890624, 8212890624, 18212890624, 918212890624, 9918212890624, 59918212890624, 259918212890624, 6259918212890624, 56259918212890624, 256259918212890624 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n)^3 mod 10^n = a(n).

a(n) is the unique positive integer less than 10^n such that a(n) is divisible by 2^n and a(n) + 1 is divisible by 5^n. - Eric M. Schmidt, Sep 01 2012

LINKS

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

FORMULA

a(n) = 5^(2^n) mod 10^n - 1.

MATHEMATICA

Table[PowerMod[5, 2^n, 10^n], {n, 20}]-1 (* Harvey P. Dale, Dec 17 2017 *)

PROG

(Sage) def A216092(n) : return crt(0, -1, 2^n, 5^n) # Eric M. Schmidt, Sep 01 2012

CROSSREFS

Cf. A007185, A016090, A216093, A091664, A018247.

Sequence in context: A071302 A211215 A249028 * A174245 A228191 A012989

Adjacent sequences:  A216089 A216090 A216091 * A216093 A216094 A216095

KEYWORD

nonn

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 26 14:28 EDT 2021. Contains 348267 sequences. (Running on oeis4.)