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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225408 10-adic integer x=.....8457 satisfying x^3 = -7. 8
 7, 5, 4, 8, 4, 9, 2, 8, 7, 7, 7, 5, 5, 7, 0, 3, 9, 2, 6, 4, 5, 4, 1, 1, 1, 9, 5, 8, 1, 4, 8, 5, 9, 9, 3, 8, 6, 4, 5, 5, 1, 8, 6, 2, 5, 9, 2, 5, 1, 4, 4, 8, 3, 2, 5, 4, 4, 9, 9, 5, 0, 9, 5, 2, 9, 1, 3, 1, 5, 2, 5, 5, 7, 7, 9, 6, 7, 7, 9, 8, 3, 4, 4, 5, 6, 9, 6, 5, 0, 2, 8, 4, 8, 7, 6, 9, 7, 4, 3, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS This is the 10's complement of A225405. LINKS Seiichi Manyama, Table of n, a(n) for n = 0..10000 FORMULA Define the sequence {b(n)} by the recurrence b(0) = 0 and b(1) = 7, b(n) = b(n-1) + 7 * (b(n-1)^3 + 7) mod 10^n for n > 1, then a(n) = (b(n+1) - b(n))/10^n. - Seiichi Manyama, Aug 13 2019 EXAMPLE 7^3 == -7 (mod 10).       57^3 == -7 (mod 10^2).      457^3 == -7 (mod 10^3).     8457^3 == -7 (mod 10^4).    48457^3 == -7 (mod 10^5).   948457^3 == -7 (mod 10^6). PROG (PARI) n=0; for(i=1, 100, m=(10^i-7); for(x=0, 9, if(((n+(x*10^(i-1)))^3)%(10^i)==m, n=n+(x*10^(i-1)); print1(x", "); break))) (PARI) N=100; Vecrev(digits(lift(chinese(Mod((-7+O(2^N))^(1/3), 2^N), Mod((-7+O(5^N))^(1/3), 5^N)))), N) \\ Seiichi Manyama, Aug 04 2019 (Ruby) def A225408(n)   ary = [7]   a = 7   n.times{|i|     b = (a + 7 * (a ** 3 + 7)) % (10 ** (i + 2))     ary << (b - a) / (10 ** (i + 1))     a = b   }   ary end p A225408(100) # Seiichi Manyama, Aug 13 2019 CROSSREFS Cf. A091663, A225405, A309600. Sequence in context: A019858 A289032 A289005 * A109134 A075778 A289033 Adjacent sequences:  A225405 A225406 A225407 * A225409 A225410 A225411 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.

Last modified June 1 11:51 EDT 2020. Contains 334762 sequences. (Running on oeis4.)