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!)
A225404 10-adic integer x such that x^3 == 3 mod 10^n for all n. 9
7, 8, 5, 4, 3, 1, 5, 9, 8, 7, 8, 0, 0, 5, 8, 3, 2, 4, 0, 6, 1, 5, 6, 6, 2, 9, 4, 8, 1, 3, 0, 3, 6, 1, 8, 4, 8, 4, 6, 1, 9, 2, 2, 1, 3, 3, 8, 6, 8, 7, 8, 8, 9, 0, 6, 5, 9, 6, 3, 5, 3, 0, 2, 4, 2, 3, 0, 9, 0, 5, 2, 1, 6, 0, 7, 0, 1, 9, 9, 4, 7, 5, 7, 9, 3, 4, 8, 6, 6, 3, 3, 1, 1, 4, 3, 3, 6, 6, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Kenny Lau, Table of n, a(n) for n = 1..10000

EXAMPLE

7^3 == 3 (mod 10).

87^3 == 3 (mod 100).

587^3 == 3 (mod 1000).

4587^3 == 3 (mod 10000).

34587^3 == 3 (mod 100000).

134587^3 == 3 (mod 1000000).

PROG

(PARI) n=0; for(i=1, 100, m=3; for(x=0, 9, if(((n+(x*10^(i-1)))^3)%(10^i)==m, n=n+(x*10^(i-1)); print1(x", "); break)))

(Python) n=7; p=1; i=1; exec("print(i, n//p); i+=1; p*=10; n+=n**3//p*7%10*p; "*10000) # Kenny Lau, Jun 07 2018

CROSSREFS

Sequence in context: A216544 A216546 A003881 * A320413 A076419 A217516

Adjacent sequences:  A225401 A225402 A225403 * A225405 A225406 A225407

KEYWORD

nonn,base

AUTHOR

Aswini Vaidyanathan, May 07 2013

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 July 13 16:22 EDT 2020. Contains 335688 sequences. (Running on oeis4.)