The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318329 The 10-adic integer a_2 = ...39062500002 satisfying a_2^5 + 1 = a_3, a_3^5 + 1 = a_4, ... , a_0^5+ 1 = a_1 and a_1^5 + 1 = a_2. 10
 2, 0, 0, 0, 0, 5, 2, 6, 0, 9, 3, 8, 3, 7, 5, 0, 0, 8, 5, 0, 4, 4, 5, 2, 0, 1, 1, 8, 7, 2, 2, 7, 9, 7, 5, 7, 5, 2, 2, 0, 6, 1, 1, 1, 7, 5, 3, 7, 0, 6, 3, 3, 5, 3, 4, 3, 8, 2, 7, 1, 2, 4, 7, 1, 1, 8, 4, 5, 3, 5, 0, 5, 1, 3, 2, 9, 1, 4, 5, 6, 6, 0, 1, 0, 9, 7, 9, 3, 6, 6, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..5000 EXAMPLE 39062500002^5 + 1 == 25000000033 (mod 10^11), 25000000033^5 + 1 == 25039135394 (mod 10^11), 25039135394^5 + 1 == 85011784225 (mod 10^11), 85011784225^5 + 1 == 17275390626 (mod 10^11), 17275390626^5 + 1 == 89599609377 (mod 10^11), 89599609377^5 + 1 == 74462890658 (mod 10^11), 74462890658^5 + 1 == 75576244769 (mod 10^11), 75576244769^5 + 1 == 34474674850 (mod 10^11), 34474674850^5 + 1 == 67812500001 (mod 10^11), 67812500001^5 + 1 == 39062500002 (mod 10^11). CROSSREFS Cf. A318327 (a_0), A318328 (a_1), this sequence (a_2), A318330 (a_3), A318331 (a_4), A318332 (a_5), A318333 (a_6), A318334 (a_7), A318335 (a_8), A318336 (a_9). Sequence in context: A261470 A006792 A011992 * A107503 A350731 A184366 Adjacent sequences: A318326 A318327 A318328 * A318330 A318331 A318332 KEYWORD nonn,base AUTHOR Seiichi Manyama, Aug 24 2018 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.

Last modified January 30 08:53 EST 2023. Contains 359942 sequences. (Running on oeis4.)