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!)
 A200505 Least m>0 such that n = 5^x-y^2 (mod m) has no solution, or 0 if no such m exists. 18
 0, 0, 4, 4, 0, 0, 4, 4, 5, 0, 4, 4, 24, 5, 4, 4, 0, 15, 4, 4, 75, 0, 4, 4, 0, 0, 4, 4, 5, 39, 4, 4, 15, 5, 4, 4, 24, 35, 4, 4, 175, 31, 4, 4, 0, 39, 4, 4, 5, 0, 4, 4, 35, 5, 4, 4, 21, 55, 4, 4, 24, 0, 4, 4, 31, 39, 4, 4, 5, 399, 4, 4, 31, 5, 4, 4, 0, 15, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS If such an m>0 exists, this proves that n is not in A051216, i.e., not of the form 5^x-y^2. On the other hand, if there are integers x, y such that n=5^x-y^2, then we know that a(n)=0. a(144) > 20000. LINKS M. F. Hasler, Table of n, a(n) for n = 0..143 FORMULA a(2+4k)=a(3+4k)=4, a(8+20k)=a(13+20k)=5 for all k>=0. EXAMPLE See A200507. PROG (PARI) A200505(n, b=5, p=3)={ my( x=0, qr, bx, seen ); for( m=3, 9e9, while( x^p < m, issquare(b^x-n) & return(0); x++); qr=vecsort(vector(m, i, i^2+n)%m, , 8); seen=0; bx=1; until( bittest(seen+=1<bx & break; next(3))); return(m))} CROSSREFS Cf. A051204-A051221, A200505-A200524. Sequence in context: A098445 A290696 A200515 * A285242 A143266 A133845 Adjacent sequences:  A200502 A200503 A200504 * A200506 A200507 A200508 KEYWORD nonn AUTHOR M. F. Hasler, Nov 18 2011 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 14 05:51 EDT 2021. Contains 345018 sequences. (Running on oeis4.)