login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120817 10-adic integer x=...07839804103263499879186432 satisfying x^5 = x; also x^3 = -x = A120818; (x^2)^3 = x^2 = A091664; (x^4)^2 = x^4 = A018248. 4
2, 3, 4, 6, 8, 1, 9, 7, 8, 9, 9, 4, 3, 6, 2, 3, 0, 1, 4, 0, 8, 9, 3, 8, 7, 0, 4, 0, 3, 5, 5, 6, 1, 4, 2, 2, 1, 4, 4, 1, 5, 4, 2, 3, 0, 3, 5, 5, 4, 0, 3, 3, 2, 2, 3, 2, 5, 9, 4, 6, 9, 3, 8, 3, 9, 5, 2, 6, 8, 6, 0, 9, 5, 7, 2, 0, 9, 1, 4, 6, 4, 3, 6, 4, 9, 6, 3, 3, 3, 0, 8, 2, 0, 3, 3, 5, 8, 8, 3, 4, 0, 4, 3, 5, 5 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

Paul D. Hanna, Table of n, a(n) for n = 0..999

FORMULA

x = 10-adic limit_{n->infty} 2^(5^n).

EXAMPLE

x equals the limit of the (n+1) trailing digits of 2^(5^n):

2^(5^0)=(2), 2^(5^1)=(32), 2^(5^2)=33554(432),

2^(5^3)=4253529586511730793292182592897102(6432), ...

x=...93839649523223304553032451441224165530407839804103263499879186432.

x^2=...0557423423230896109004106619977392256259918212890624 (A091664).

x^3=...6695446967548558775834469592160195896736500120813568 (A120818).

x^4=...9442576576769103890995893380022607743740081787109376 (A018248).

x^5=...3304553032451441224165530407839804103263499879186432 = x.

PROG

(PARI) {a(n)=local(b=2, v=[]); for(k=1, n+1, b=b^5%10^k; v=concat(v, (10*b\10^k))); v[n+1]}

(PARI) {a(n)=if(n<0, 0, lift(chinese(Mod(truncate( teichmuller(2+O(5^(n+1)))), 5^(n+1)), Mod(0, 2^(n+1))))\10^n)} /* Michael Somos Oct 03 206 */

CROSSREFS

Cf. A120818, A091664, A018248.

Sequence in context: A036413 A069912 A152306 * A166310 A109852 A083197

Adjacent sequences:  A120814 A120815 A120816 * A120818 A120819 A120820

KEYWORD

base,nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 06 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 15 02:49 EST 2012. Contains 205694 sequences.