cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A225460 10-adic integer x such that x^9 = -7.

Original entry on oeis.org

3, 9, 3, 0, 5, 7, 6, 9, 2, 6, 3, 2, 0, 3, 7, 3, 2, 2, 7, 8, 5, 9, 0, 7, 3, 4, 3, 0, 2, 1, 0, 1, 0, 2, 4, 9, 6, 2, 6, 2, 1, 4, 7, 1, 9, 6, 7, 3, 3, 6, 8, 6, 5, 8, 6, 2, 4, 6, 5, 4, 6, 5, 3, 4, 6, 4, 1, 9, 0, 3, 2, 6, 0, 8, 3, 5, 5, 4, 0, 6, 1, 5, 8, 1, 3, 5, 8, 1, 4, 0, 3, 7, 3, 5, 6, 6, 6, 8, 0, 9
Offset: 0

Views

Author

Aswini Vaidyanathan, May 11 2013

Keywords

Comments

This is the 10's complement of A225457.

Examples

			       3^9 == -7 (mod 10).
      93^9 == -7 (mod 10^2).
     393^9 == -7 (mod 10^3).
     393^9 == -7 (mod 10^4).
   50393^9 == -7 (mod 10^5).
  750393^9 == -7 (mod 10^6).
		

Crossrefs

Programs

  • PARI
    n=0;for(i=1,100,m=(10^i-7);for(x=0,9,if(((n+(x*10^(i-1)))^9)%(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/9), 2^N), Mod((-7+O(5^N))^(1/9), 5^N)))), N) \\ Seiichi Manyama, Aug 05 2019